Positional Notation as an Ultrametric Tree of Cyclic Time

In the paper's words

Positional numeral systems are traditionally interpreted as linear encodings of magnitude. This paper shows that such systems naturally form rooted ultrametric trees whose levels correspond to nested cyclic temporal units (seconds → minutes → hours → days). The b‑adic valuation d(x,y)=b^-v_b(x-y) defines an ultrametric on integers ([6]), and mixed‑radix historical systems (sexagesimal, Mayan) instantiate cyclic bases that mirror calendar cycles.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. The number of bits required to index this space is $$ \log_2 N_R = \log_2(2^7 \cdot 3^3 \cdot 5^2 \cdot 7). $$ Using $\log_2 3 = 1.584963$, $\log_2 5 = 2.321928$, $\log_2 7 = 2.807355$, $$ \log_2 N_R = 7 + 3(1.584963) + 2(2.321928) + 2.807355 = 7 + 4.754889 + 4.643856 + 2.807355 = 19.206100. $$ Hence indexing one week of seconds requires 19.2061 bits .

   from 4.3. State‑space size and bit cost of the week clock

2. Uniform cycle lengths : Each cycle is assumed to have a constant length, ignoring irregularities (e.g., months with 28–31 days).

   from 6.1. Limitations

3. Each calendar coordinate is uniformly distributed, so its entropy is $\log_2$ of its radix: $$ \begin{aligned} H_1 &= \log_2 60 = 5.906891,\\ H_2 &= \log_2 60 = 5.906891,\\ H_3 &= \log_2 24 = 4.584963,\\ H_4 &= \log_2 7 = 2.807355. \end{aligned} $$ The total entropy is $$ H_{\text{total}} = H_1+H_2+H_3+H_4 = 19.206100\ \text{bits}, $$ matching the direct $\log_2 N_R$ computation in Section 4.3.

   from 4.5. Per‑level entropies

4. A statistically significant improvement ($p \lt 0.05$) would support the claim; a lack of improvement would falsify it.

   from 7.3. Minimal next experiment

How it is done

1. We prove that mixed‑radix cyclic numeral systems induce a symbolic ultrametric whose distance equals the depth of the least common ancestor.

   from Abstract

2. Proof that mixed‑radix cyclic numeral systems (sexagesimal, Mayan) induce a symbolic ultrametric whose distance equals the depth of the least common ancestor (Section 3).

   from 1. Introduction

3. We instantiate the mixed‑radix system with the civil week radices $$ (b_{\text{sec}},b_{\text{min}},b_{\text{hour}},b_{\text{day}})=(60,60,24,7). $$ A timestamp $t$ is encoded as a 4‑tuple $(s,m,h,d)$ where $s$ is seconds, $m$ minutes, $h$ hours, and $d$ day‑of‑week (with $d\in\{0,\dots,6\}$).

   from 3.3. Calendar‑tree construction for a civil week clock

4. Formally, if for any three timestamps $a,b,c$ we find $$ \ell_{\text{LCA}}(a,b) \gt \ell_{\text{LCA}}(a,c) \quad\text{but}\quad d(a,b) \gt d(a,c), $$ the ultrametric construction is invalid.

   from 6.2. Failure modes and falsification

What would falsify it

1. A single observation that would falsify the main claim is the detection of a pair of timestamps that share a deeper common prefix yet exhibit a larger ultrametric distance than a pair with a shallower prefix.

   from 6.2. Failure modes and falsification

2. Empirical measurement of distances on a large calendar‑aligned dataset (e.g., smart‑meter readings) provides a direct falsification test.

   from 6.2. Failure modes and falsification

3. Critical discussion of assumptions, failure modes, and falsifiability criteria (Section 6).

   from 1. Introduction

Where the claim stops

1. Uniform cycle lengths : Each cycle is assumed to have a constant length, ignoring irregularities (e.g., months with 28–31 days).

   from 6.1. Limitations

2. Critical discussion of assumptions, failure modes, and falsifiability criteria (Section 6).

   from 1. Introduction

3. Scalability : Pairwise distance matrices can be constructed efficiently using vectorised operations; for very large datasets, approximate nearest‑neighbour methods can exploit the bounded number of distance values.

   from 7.4. Engineering constraints

Where to read

1. Abstract206 words · 1 min
2. 1. Introduction240 words · 1 min
3. 2. Background and Related Work366 words · 2 min
4. 3. Methods295 words · 1 min
5. 4. Analysis541 words · 2 min
6. 5. Results122 words · 1 min
7. 6. Discussion206 words · 1 min
8. 7. Practical Implications and Engineering Pathways281 words · 1 min
9. 8. Conclusion94 words · 1 min
10. Correction Notice379 words · 2 min
11. Provenance and AI Involvement241 words · 1 min
12. Appendix A. Divergence report70 words · 1 min