๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Estimate of the concentration function for a class of additive functions

โœ Scribed by M. B. Khripunova; A. A. Yudin

Book ID
110149229
Publisher
SP MAIK Nauka/Interperiodica
Year
2007
Tongue
English
Weight
547 KB
Volume
82
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Asymptotic Estimates for a Class of Summ
Asymptotic Estimates for a Class of Summatory Functions
โœ U Balakrishnan; Y.-F.S Pรฉtermann ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 402 KB

We establish explicit expressions for both P and E in n x a(n)=P(x)+E(x)= ``principal term''+``error term'', when the (complex) arithmetical function a has a generating function of the form `(s) Z(s), where `is the Riemann zeta function, and where Z has a representation as a Dirichlet series having

ON A CLASS OF ADDITIVE UTILITY FUNCTIONS
ON A CLASS OF ADDITIVE UTILITY FUNCTIONS
โœ Kotaro Suzumura; Hiroshi Ono ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB
A class of additive multiplicative graph
A class of additive multiplicative graph functions
โœ Lih-Hsing Hsu; Chiuyuan Chen; En-Yih Jean ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 650 KB

For a fixed graph G, the capacity function for G, Po, is defined by Pc(H)= lim,\_\_,ยฎ[yo(H')] TM, where y6(H) is the maximum number of disjoint G's in H. In , Hsu proved that Pr2 can be viewed as a lower bound for multiplicative increasing graph functions. But it was not known whether Pr2 is multipl