Bounded discrepancy for replicated tree factorials

We give a sufficient condition for bounded counting discrepancy of greedy factorial sequences on a family of finite-type trees. The family has two types, with one outgoing edge list obtained by replicating the other and with synchronized positive rational lengths. The ordered merge then separates into fixed finite blocks. This gives explicit constant bounds for every root edge and, uniformly in depth, every boundary cylinder, for every legal choice at ties. In the smallest model the root bound is 1, attained by a fixed tie rule, and the cylinder bound is 3. Its factorial sequence is a_A(n) = n − z₃(n), where z₃ counts nonzero ternary digits. Thus its factorial deficit grows logarithmically along a subsequence while all cylinder counting discrepancies remain bounded. A separated p-adic realization gives a nonregular compact set with the same exact factorial exponents and bounded ball discrepancy for every p-ordering.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24332695
Primary Topic
p-Adic Analysis and Mathematical Physics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Bounded discrepancy for replicated tree factorials

Zihuan Xu
Zenodo (CERN European Organization for Nuclear Research)
p-Adic Analysis and Mathematical Physics
preprint

Bounded discrepancy for replicated tree factorials

Zihuan Xu
preprint en

Abstract

We give a sufficient condition for bounded counting discrepancy of greedy factorial sequences on a family of finite-type trees. The family has two types, with one outgoing edge list obtained by replicating the other and with synchronized positive rational lengths. The ordered merge then separates into fixed finite blocks. This gives explicit constant bounds for every root edge and, uniformly in depth, every boundary cylinder, for every legal choice at ties. In the smallest model the root bound is 1, attained by a fixed tie rule, and the cylinder bound is 3. Its factorial sequence is a_A(n) = n − z₃(n), where z₃ counts nonzero ternary digits. Thus its factorial deficit grows logarithmically along a subsequence while all cylinder counting discrepancies remain bounded. A separated p-adic realization gives a nonregular compact set with the same exact factorial exponents and bounded ball discrepancy for every p-ordering.

Zenodo (CERN European Organization for Nuclear Research)
Capital Normal University (CN)
p-Adic Analysis and Mathematical Physics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon