Modular Ackermann maps and hierarchical hash constructions

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Pain, Jean-Christophe
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914425563250688
author Pain, Jean-Christophe
author_facet Pain, Jean-Christophe
contents We introduce and study modular truncations of the Ackermann function viewed as self-maps on finite rings. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural properties, sensitivity to depth variation, and induced distributions modulo powers of two. Motivated by these properties, we define hierarchical hash-type constructions based on depth-dependent Ackermann evaluation. Several conjectures and open problems on distribution, cycle structure, and asymptotic behavior are proposed.
format Preprint
id arxiv_https___arxiv_org_abs_2603_25677
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Modular Ackermann maps and hierarchical hash constructions
Pain, Jean-Christophe
Combinatorics
We introduce and study modular truncations of the Ackermann function viewed as self-maps on finite rings. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural properties, sensitivity to depth variation, and induced distributions modulo powers of two. Motivated by these properties, we define hierarchical hash-type constructions based on depth-dependent Ackermann evaluation. Several conjectures and open problems on distribution, cycle structure, and asymptotic behavior are proposed.
title Modular Ackermann maps and hierarchical hash constructions
topic Combinatorics
url https://arxiv.org/abs/2603.25677