SearcharxivSearch

arXiv · 2609.25742

Zero-Run Spectra of the $(3,2)$ Raney numbers Modulo Primes

Abstract

We study the zero-run structure of the $(3,2)$-Raney numbers modulo a prime $p$. For every prime $p$, we determine the left-to-right maxima of the zero-run lengths, the complete zero-run spectrum, and the exact number of nonzero entries in $0\le n<p^m$. Interestingly, these results fall into three cases: $p=2$, $p=3$, and $p\geq5$, and the behaviors in these three cases are very different. For $p=2$, we characterize exactly the odd terms and determine the positions of the left-to-right maxima and the results involve Fibbinary integers, Fibonacci numbers, and Jacobsthal numbers. For $p=3$, we characterize exactly the nonzero terms and determine their residues. For $p\ge 5$, the zero runs are governed by a multiscale system of residue intervals modulo powers of $p$, from which both the record values and the complete zero-run spectrum are obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sen-Peng Eu, Zai-Ting Huang, Louis Kao. 2026-09-22. Zero-Run Spectra of the $(3,2)$ Raney numbers Modulo Primes. https://arxiv.org/abs/2609.25742

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO