Voronoi summation formulae and multiplicative functions on permutations (Q539128): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:34, 5 March 2024

scientific article
Language Label Description Also known as
English
Voronoi summation formulae and multiplicative functions on permutations
scientific article

    Statements

    Voronoi summation formulae and multiplicative functions on permutations (English)
    0 references
    0 references
    27 May 2011
    0 references
    Consider sequences of complex numbers \(\{ a(n)\} \) and positive numbers \(\{p(n)\}\). The series \(\{\sum_0^na(i)\}\) is summable to \(A\) in the sense of Voronoi if we have \(r(n)/p(n)\rightarrow A\), where \(r(n)=a*p(n)=\sum_{k=0}^na(k)p(n-k)\). Let the generating functions of \(\{a(n)\}\), \(\{p(n)\} \) be given by \(g\) and \(p\) respectively. The generating function of \(\{r(n)\}\) is given by \(r(x)=g(x)p(x)\), and the following Abelian theorem holds. If \(r(n)/p(n)\rightarrow A\) as \( n\rightarrow \infty \), and if \(p(1)=\infty \), then \(g(x)\rightarrow A\) as \( x\rightarrow 1\). In the present paper, the author proves a corresponding Tauberian theorem. Moreover, in the main result of the paper, he estimates the difference \( r(n)/p(n)-g(\exp (-1/n))\) even for the case that \(g(x)\) does not converge to a finite limit. He proves this result in the case that \(g\) is analytic in \(|x|<1\) and \(np(n)=p*d(n)\) for a sequence \(\{d(n\}\) with \(0<m\leq d(n)\leq M<\infty \). These results on the Voronoi summability are then applied to analyze the mean values of multiplicative functions on random permutations.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Tauberian theorems
    0 references
    Voronoi summability
    0 references
    Nörlund summability
    0 references
    random permutations
    0 references
    additive functions
    0 references
    multiplicative functions
    0 references