Euler-Frobenius numbers and rounding
From MaRDI portal
Publication:5494784
Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Spline approximation (41A15) Combinatorial probability (60C05) Probability distributions: general theory (60E05) Central limit and other weak theorems (60F05) Computer aspects of numerical algorithms (65Y99)
Abstract: We study the Euler-Frobenius numbers, a generalization of the Eulerian numbers, and the probability distribution obtained by normalizing them. This distribution can be obtained by rounding a sum of independent uniform random variables; this is more or less implicit in various results and we try to explain this and various connections to other areas of mathematics, such as spline theory. The mean, variance and (some) higher cumulants of the distribution are calculated. Asymptotic results are given. We include a couple of applications to rounding errors and election methods.
Recommendations
Cited in
(10)- An asymptotic distribution theory for Eulerian recurrences with applications
- On the asymptotic normality of the Legendre-Stirling numbers of the second kind
- A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices
- Euler-Frobenius numbers
- Asymptotics of Stirling and Chebyshev-Stirling numbers of the second kind
- Some asymptotic results on \(q\)-binomial coefficients
- The variance of the discrepancy distribution of rounding procedures, and sums of uniform random variables
- Random recursive hypergraphs
- Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers
- A refinement of the Sylvester problem: probabilities of combinatorial types
This page was built for publication: Euler-Frobenius numbers and rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494784)
