Work

Bounded discrepancy for replicated tree factorials

Year: 2026
Type: preprint
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.
Author: Xu, Zihuan
Language: English
Open Access status: green
OpenAlex ID: W7236237679
Cites:
Cited by:
Related to: 9