Search arXiv⌕ Search

arXiv · 2508.20026

Hyperbinary partitions and q-deformed rationals

Abstract

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n). Morier-Genoud and Ovsienko defined the q-analogue of a rational number [r/s]_q in various ways, most of which depend directly or indirectly on the continued fraction expansion of r/s. As our first application we show that [r/s]_q = q h_q(n-1)/h_q(n) where r/s occurs as the nth entry in the Calkin-Wilf enumeration of the non-negative rationals. Next we consider fence posets which are those which can be obtained from a sequence of chains by alternately pasting together maxima and minima. For every n we show there is a fence poset F(n) whose lattice of order ideals is isomorphic to the poset of hyperbinary partitions of n ordered by refinement. For our last application, Morier-Genoud and Ovsienko also showed that [r/s]_q can be computed by taking products of certain matrices which are q-analogues of the standard generators for the special linear group SL(2,R). We express the entries of these products in terms of the polynomials h_q(n).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas McConville, James Propp, Bruce E. Sagan. 2025-08-27. Hyperbinary partitions and q-deformed rationals. https://doi.org/10.1017/fms.2026.10182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗