Positional numeral systems over polyadic rings
Pith reviewed 2026-05-19 09:21 UTC · model grok-4.3
The pith
Every commutative polyadic ring admits a base-p place-value expansion that respects a quantized constraint on operation word lengths.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Every commutative (m,n)-ring admits a base-p place-value expansion that respects the word length constraint in terms of numbers of operation compositions ℓ_mult=ℓ_add(m-1)+1.
What carries the argument
A base-p place-value expansion whose additive and multiplicative word lengths obey the quantized relation ℓ_mult = ℓ_add(m-1) + 1, ensuring consistency with the multi-argument ring operations.
If this is right
- The minimum number of digits required is at least the addition arity m.
- For m and n at least 3, only a proper subset of ring elements have finite expansions, labeled by congruence-class invariants I^(m) and J^(n).
- Mixed-base polyadic clocks, with a different base allowed at each position, enlarge the space of possible representations.
- Explicit catalogues exist for the rings Z_{4,3} and Z_{6,5} showing how ordinary integers correspond to distinct polyadic variables.
Where Pith is reading between the lines
- The quantized-length constraint may extend naturally to designing arithmetic circuits that perform multi-operand operations in a single step.
- The representability gap suggests a classification problem: which congruence classes of elements are exactly those with finite expansions.
- Mixed-base versions could be tested for efficiency gains in encoding schemes that adapt base to position.
Load-bearing premise
The multi-argument addition and multiplication operations must permit consistent place-value expansions under the specific length relation without internal contradictions.
What would settle it
A concrete commutative (m,n)-ring in which at least one element has no base-p digit string satisfying the length constraint ℓ_mult=ℓ_add(m-1)+1.
read the original abstract
We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a multiplicative tower are not arbitrary (as in the binary case), but "quantized". Our main contributions are the following. Existence: every commutative $\left( m,n\right) $-ring admits a base-$p$ place-value expansion that respects the word length constraint in terms of numbers of operation compositions $\ell_{mult}=\ell_{add}(m-1)+1$. Lower bound: the minimum number of digits is greater than or equal to the arity of addition $m$. Representability gap: for $m,n\geq3$ only a proper subset of ring elements possess finite expansions, characterized by congruence-class arity shape invariants $I^{(m)}$ and $J^{(n)}$. Mixed-base "polyadic clocks": allowing a different base at each position enlarges the design space quadratically in the digit count. Catalogues: explicit tables for the integer rings $\mathbb{Z}_{4,3}$ and $\mathbb{Z}_{6,5}$ illustrate how ordinary integers lift to distinct polyadic variables. These results lay the groundwork for faster arity-aware arithmetic, exotic coding schemes, and hardware that exploits operations beyond the binary pair.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper constructs positional numeral systems that work natively over non-derived commutative polyadic (m,n)-rings. It claims three main results: (i) every such ring admits a base-p place-value expansion respecting the quantized length constraint ℓ_mult = ℓ_add(m-1)+1, (ii) the minimum number of digits is at least the addition arity m, and (iii) for m,n ≥ 3 only a proper subset of elements have finite expansions, characterized by congruence-class arity shape invariants I^(m) and J^(n). Additional contributions include mixed-base constructions and explicit catalogues for the rings ℤ_{4,3} and ℤ_{6,5}.
Significance. If the central existence and invariance claims hold, the work provides a foundation for arity-aware positional representations in higher-arity algebras, with possible implications for specialized arithmetic circuits and coding schemes that exploit multi-argument operations beyond the binary case.
major comments (1)
- [Existence theorem and recursive definition of place value] The existence theorem (abstract and § on main constructions) asserts that every commutative (m,n)-ring admits a base-p expansion respecting ℓ_mult = ℓ_add(m-1)+1. However, the recursive definition of the value of a digit string via m-ary sums and n-ary products must produce expression trees whose composition counts satisfy the relation exactly. In non-derived polyadic rings the generalized distributivity law is multi-ary; reassociating an additive subexpression inside a multiplicative tower can alter the total number of operation compositions. The manuscript does not appear to contain an explicit verification that the chosen length relation is invariant under this law for arbitrary parenthesizations. This invariance is load-bearing for the claim that the expansion exists for every ring element.
minor comments (2)
- [Representability gap] The invariants I^(m) and J^(n) are described as congruence-class arity shape invariants; a short paragraph or diagram showing how they are computed from the ring elements would improve accessibility.
- [Explicit tables] In the catalogues for ℤ_{4,3} and ℤ_{6,5}, the tables should explicitly label which columns represent ordinary integers and which represent the lifted polyadic variables to avoid reader confusion.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive feedback on our manuscript. We address the major comment on the existence theorem below.
read point-by-point responses
-
Referee: [Existence theorem and recursive definition of place value] The existence theorem (abstract and § on main constructions) asserts that every commutative (m,n)-ring admits a base-p expansion respecting ℓ_mult = ℓ_add(m-1)+1. However, the recursive definition of the value of a digit string via m-ary sums and n-ary products must produce expression trees whose composition counts satisfy the relation exactly. In non-derived polyadic rings the generalized distributivity law is multi-ary; reassociating an additive subexpression inside a multiplicative tower can alter the total number of operation compositions. The manuscript does not appear to contain an explicit verification that the chosen length relation is invariant under this law for arbitrary parenthesizations. This invariance is load-bearing for the claim that the expansion exists for every ring element.
Authors: We appreciate the referee's identification of this subtlety in the recursive definition. The original manuscript defines the place-value recursively via the polyadic operations and asserts that the length relation holds by construction for the generated expressions, but we acknowledge that an explicit invariance proof under arbitrary reassociations via the multi-ary distributivity law was not supplied. In the revised manuscript we will insert a new lemma (in the section on main constructions) that proves the relation ℓ_mult = ℓ_add(m-1)+1 is preserved under any parenthesization. The argument proceeds by induction on tree depth, using commutativity of the ring and the specific arity relation to show that each reassociation step maintains the exact composition count. This addition directly addresses the load-bearing concern and strengthens the existence claim. revision: yes
Circularity Check
No circularity: constructions follow directly from polyadic ring axioms and arity definitions
full rationale
The paper defines positional expansions over (m,n)-rings using the quantized length relation derived from the multi-ary operation arities themselves. The existence statement is a constructive claim resting on the ring axioms and the given length constraint ℓ_mult=ℓ_add(m-1)+1, without any reduction of the target expansions to fitted parameters, self-referential definitions, or load-bearing self-citations. The representability gap is characterized via independent congruence invariants I^(m) and J^(n), and mixed-base extensions are presented as enlargements of the design space. No step equates a prediction to its input by construction or imports uniqueness via unverified author prior work.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The (m,n)-ring is commutative
invented entities (1)
-
Congruence-class arity shape invariants I^(m) and J^(n)
no independent evidence
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/ArithmeticFromLogic.leanLogicNat recovery and embed_strictMono echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
Existence: every commutative (m,n)-ring admits a base-p place-value expansion that respects the word length constraint ... ℓ_mult = ℓ_add(m-1)+1
-
IndisputableMonolith/Foundation/Breath1024.leanperiod8 and flipAt512 echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
double quantization of word length ... wadmiss_μ(n) = ℓ_μ(n-1)+1
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.