Moments for the multidimensional Mönkemeyer algorithm
From MaRDI portal
Recommendations
- Asymptotics for two-dimensional Farey-Brocot nets
- An elementary derivation of the asymptotics of partition functions
- Asymptotics for the partial fractions of the restricted partition generating function. II
- Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic
- scientific article; zbMATH DE number 5067693
- Polynomials expressible by sums of monic integer irreducible polynomials
- On the multiplicity of parts in a random partition
- The enumeration of the partitions of multipartite numbers.
- A general asymptotic scheme for the analysis of partition statistics
- An expansion for the number of partitions of an integer
Cites work
- Asymptotics for two-dimensional Farey-Brocot nets
- Entropies of the partitions of the unit interval generated by the Farey tree
- Farey nets and multidimensional continued fractions
- scientific article; zbMATH DE number 3737757 (Why is no real title available?)
- scientific article; zbMATH DE number 1503600 (Why is no real title available?)
- scientific article; zbMATH DE number 218556 (Why is no real title available?)
- Maps of intervals with indifferent fixed points: thermodynamic formalism and phase transitions
- Moments for generalized Farey-Brocot partitions
- Partitioning of the interval [0,1] induced by the Brocot sequences
- Über Fareynetze in n Dimensionen
Cited in
(2)
This page was built for publication: Moments for the multidimensional Mönkemeyer algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931150)
