Search arXivSearch

arXiv · 2603.25677

Modular Ackermann maps and hierarchical structures

Abstract

We introduce and study modular truncations of the Ackermann function, formalized as discrete dynamical trajectories on the set of least non-negative residues. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural properties, sensitivity to depth variation, and the induced distributions modulo powers of two. While such hierarchical constructions are superficially motivated by hash-type mixing functions, we analyze how powers of two interact with the recursive structure modulo $2^k$, leading to strong saturation effects in the depth $m=3$ case. Instead of the expected asymptotic equidistribution, an absorption phenomenon occurs where the uniform measure concentrates onto a localized subset of residues, driving the total variation distance from the uniform distribution to 1.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Pain. 2026-06-09. Modular Ackermann maps and hierarchical structures. https://arxiv.org/abs/2603.25677

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