Generating new partition identities via a generalized continued fraction algorithm
From MaRDI portal
Abstract: Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
Recommendations
Cites work
- A slow triangle map with a segment of indifferent fixed points and a complete tree of rational pairs
- Ergodic properties of triangle partitions
- Geometry of continued fractions
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1503600 (Why is no real title available?)
- scientific article; zbMATH DE number 2214406 (Why is no real title available?)
- Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles
- On periodic sequences for algebraic numbers
- On the second Lyapunov exponent of some multidimensional continued fraction algorithms
- Representation and coding of rational pairs on a triangular tree and Diophantine approximation in R^2
- Simplicity of spectra for certain multidimensional continued fraction algorithms
This page was built for publication: Generating new partition identities via a generalized continued fraction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6117426)