Preprint
Article

This version is not peer-reviewed.

Canonical Number Systems in Multiple Dimensions and Their Representation Scope

Submitted:

25 December 2025

Posted:

26 December 2025

You are already at the latest version

Abstract
We extend classical canonical number systems to an $n$-dimensional setting and investigate representation scope: when rings and modules admit digit expansions, with illustrative constructions and stability under products.
Keywords: 
;  ;  ;  

1. Introduction

Following Akiyama–Petho [1, AkiyamaPetho], the pair { P ( x ) , N } is a canonical number system (CNS) if every α Z [ x ] / ( P ( x ) ) , α 0 , admits a unique finite expansion α = j = 0 ( α ) a j x j with a j N and a ( α ) 0 .
  • Polynomial/base specialization. Let P ( x ) Z [ x ] be monic with | P ( 0 ) | 2 , put R = Z [ x ] / ( P ) , and let x ¯ be the class of x in R. With the digit set N = { 0 , 1 , , | P ( 0 ) | 1 } (a transversal of R / x ¯ R ), We say ( P , N ) (or equivalently ( R , x ¯ , N ) ) is a CNS if every γ R has a unique finite expansion
γ = k = 0 n k x ¯ k , n k N .
If P is irreducible and α is a root, this is the same as unique finite α -expansions in R Z [ α ] ; in this case α is called a CNS base.
Example 1
(A concrete CNS expansion). Take P ( x ) = x + 2 (here d = 1 and p 0 = 2 ). Then
R = Z [ x ] / ( x + 2 ) Z [ x ] , N = { 0 , 1 } .
In R I have the relation x 2 . Consider α = 23 R . Define digits a 0 , , a 6 N by
( a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 ) = ( 1 , 1 , 0 , 1 , 0 , 1 , 1 ) .
Then α has the (CNS-style) digit expansion
23 = 1 + x + x 3 + x 5 + x 6 = j = 0 6 a j x j , a j N .
Indeed, using x 2 in R,
1 + x + x 3 + x 5 + x 6 = 1 + ( 2 ) + ( 2 ) 3 + ( 2 ) 5 + ( 2 ) 6 = 23 .
Equivalently, if γ = 2 (a root of x + 2 ), this reads 23 = j = 0 6 a j γ j with a j { 0 , 1 } .
Canonical number systems (CNS) were developed in the polynomial setting by S. Akiyama and A. Pethő [2], and later studied over more general coefficient domains (for instance Euclidean domains) by A. Pethő and P. Varga [3]. In these works, a CNS is a positional representation in a quotient ring such as R = Z [ x ] / ( P ( x ) ) , where every element admits a finite expansion in powers of a single base (the class of x) using digits from a fixed finite set.
Related ideas also appear in the study of number systems arising from the Chinese Remainder Theorem, notably in work of van de Woestijne [4], where representations are constructed by decomposing rings into simpler components and recombining them through compatible digit systems. Moreover, earlier work of Kovács and Pethő [5,6] demonstrates that finite digit representations can exist in a variety of algebraic settings beyond the classical polynomial quotient framework, especially in integral domains and orders of algebraic number fields.
Motivated by these developments, in this paper we extend the classical one–base notion of CNS to an n–dimensional representation framework. Rather than fixing a single base, we allow several commuting shift maps to generate place values. Our primary interest is the representation scope of this extension: identifying broad classes of rings and modules for which such n–dimensional systems provide digit expansions for every element, and clarifying the conditions under which these expansions exist and are unique.

2. Preliminary

In the classical (one–base) setting, choosing an integer base b 2 automatically provides the structural properties needed for a positional representation: the map m b m on Z is injective, powers b k yield distinct place values, and there is only one shift so no ordering issues arise. In an n–dimensional (multi–base) setting, however, “place values” are generated by a family of Z -endomorphisms T 1 , , T m , and these properties are no longer automatic. Therefore we redefine what it means to be a base by imposing:
Definition 1
(Base family). Let L be a Z -module and let T 1 , , T m End Z ( L ) . We call the ordered family T = ( T 1 , , T m ) a base on L if it satisfies:
1. 
Injective.  Each T i is injective.
2. 
Commuting.  The endomorphisms commute pairwise:
T i T j = T j T i ( 1 i , j m ) .
3. 
Independent (no base is generated by the others).  For each i { 1 , , m } and each integer a 1 , the power T i a cannot be written as a composition of powers of the remaining maps. Equivalently, there do not exist exponents β j N 0 ( j i ) such that
T i a = j i T j β j .
(Under the commuting assumption, the product is well-defined independent of order.)
Example 2
(Classical base 10 on Z ). Let L = Z and define the (single) base map
T : Z Z , T ( m ) = 10 m .
Then T is injective. The associated place values are T k ( 1 ) = 10 k . For instance,
372 = 2 + 10 · 7 + 10 2 · 3 = k = 0 2 T k ( d k ) ( d k { 0 , 1 , , 9 } ) .
Example 3.
(A multi-base family on Z [ x 1 , x 2 ] : 10, x 1 , x 2 ) Let L = Z [ x 1 , x 2 ] and define three Z -endomorphisms by multiplication:
T 1 ( f ) = 10 f , T 2 ( f ) = x 1 f , T 3 ( f ) = x 2 f .
Then each T i is injective (since Z [ x 1 , x 2 ] is an integral domain), and they commute:
T i T j = T j T i ( 1 i , j 3 ) ,
because multiplication by 10 , x 1 , x 2 commutes in the commutative ring Z [ x 1 , x 2 ] .
Moreover, the family is independent in the sense that distinct exponent triples produce distinct place maps. Writing
T ( a , b , c ) : = T 1 a T 2 b T 3 c ,
we have
T ( a , b , c ) ( 1 ) = 10 a x 1 b x 2 c ,
and if T ( a , b , c ) = T ( a , b , c ) then 10 a x 1 b x 2 c = 10 a x 1 b x 2 c , hence ( a , b , c ) = ( a , b , c ) .
Finally, a polynomial can be expanded by writing each integer coefficient in base 10. For example,
f ( x 1 , x 2 ) = 123 + 45 x 1 + 6 x 2 + 78 x 1 2 x 2
can be written as a finite sum of places 10 a x 1 b x 2 c with digits in { 0 , , 9 } :
f = ( 3 + 10 · 2 + 10 2 · 1 ) + ( 5 + 10 · 4 ) x 1 + ( 6 ) x 2 + ( 8 + 10 · 7 ) x 1 2 x 2 = a , b , c d a , b , c 10 a x 1 b x 2 c = a , b , c T 1 a T 2 b T 3 c ( d a , b , c ) , d a , b , c { 0 , , 9 } ,
where only finitely many d a , b , c are nonzero.
Example 4
(A finite ring: F p and the identity map). Let L = F p (viewed as an abelian group). Take the base map
T = id L .
Then T is injective and T k = id L for all k. Every element a F p already has the trivial “expansion” a = d 0 (one digit). Remark: F p is not a free Z -module, so this example is meant only to illustrate the idea of a base map (identity) in a finite setting.
Example 5
(A non-commutative ring: M 2 ( Z ) with base 2 ). Let L = M 2 ( Z ) , viewed as a free Z -module of rank 4 with basis E 11 , E 12 , E 21 , E 22 . Define the base endomorphism
T : L L , T ( A ) = ( 2 ) A .
Then T is injective and L / T ( L ) M 2 ( Z ) / 2 M 2 ( Z ) is finite.
A natural digit set is
D = a b c d : a , b , c , d { 0 , 1 } ,
which is a complete set of representatives of L / T ( L ) (entrywise reduction mod 2). Hence every A M 2 ( Z ) has a unique decomposition
A = d + T ( W ) = d 2 W , d D , W M 2 ( Z ) ,
and iterating yields a finite T-expansion
A = k = 0 T k ( d k ) = k = 0 ( 2 ) k d k , d k D .
For instance, for
A = 2 3 1 0 ,
one possible expansion is
2 3 1 0 = 0 1 1 0 + ( 2 ) 1 0 0 0 + ( 2 ) 2 1 1 0 0 + ( 2 ) 3 0 1 0 0 ,
with all digits in D.
Example 6.
(A one–base CNS on L = Z F 2 [ x ] ) Let L : = Z F 2 [ x ] (as a Z –module). Define the (single) base endomorphism
T : L L , T ( a , f ) : = ( 10 a , x f ) .
Fix the base frame
b = ( b 1 , b 2 ) : = ( 1 , 0 ) , ( 0 , 1 ) L 2 .
Then for each k 0 ,
T k ( b 1 ) = ( 10 k , 0 ) , T k ( b 2 ) = ( 0 , x k ) .
Let the digit alphabets be
D 1 : = { 0 , 1 , , 9 } Z , D 2 : = { 0 , 1 } Z ,
and set the digit set
D : = D 1 × D 2 Z 2 .
  • We redefine the digit set in the multi-base setting because, unlike the classical one–base case (where digits are representatives of L / T ( L ) ), several base maps T 1 , , T m contribute to the “higher-place” part, so digits must represent the quotient by the combined image L / i = 1 m T i ( L ) in order to retain a unique remainder (coset) decomposition.
Definition 2
(Digit set for a base family). Let L be a Z -module and let T = ( T 1 , , T m ) End Z ( L ) be a base family. Set
T ( L ) : = i = 1 m T i ( L ) L .
A digit set (for T ) is a finite subset D L such that 0 D and D is a complete set of representatives of the quotient L / T ( L ) . Equivalently, every v L admits a unique coset decomposition
v = d + u , d D , u T ( L ) ,
i.e. the natural projection π : L L / T ( L ) restricts to a bijection D L / T ( L ) . In particular, for each v L there exist w 1 , , w m L such that
v = d + i = 1 m T i ( w i ) , d D .
Remark 1.
The remainder digit d is unique by construction. The tuple ( w 1 , , w m ) need not be unique unless additional hypotheses are imposed (e.g. i T i ( L ) is a direct sum). When m = 1 , this reduces to the usual condition that D is a transversal of L / T ( L ) .
Example 7
(Digit sets in common settings).
1. 
Integers  Z  (one base).  Let L = Z and T ( m ) = 10 m . Then T ( L ) = 10 Z and
L / T ( L ) Z / 10 Z .
A standard digit set is
D = { 0 , 1 , , 9 } ,
so every z Z has a unique decomposition z = d + 10 w with d D , w Z .
2. 
Polynomials  Z [ x 1 , x 2 ]  (a base family).  Let L = Z [ x 1 , x 2 ] and define
T 1 ( f ) = 10 f , T 2 ( f ) = x 1 f , T 3 ( f ) = x 2 f .
Then
T ( L ) = T 1 ( L ) + T 2 ( L ) + T 3 ( L ) = 10 L + x 1 L + x 2 L .
Modulo x 1 L + x 2 L only the constant term remains, and modulo 10 L the constant term is taken modulo 10, hence
L / T ( L ) Z / 10 Z .
Thus one may again take the digit set
D = { 0 , 1 , , 9 } Z Z [ x 1 , x 2 ] ,
and every f Z [ x 1 , x 2 ] admits a unique decomposition f = d + u with d D and u 10 L + x 1 L + x 2 L .
3. 
Matrices  M 2 ( Z )  (noncommutative ring, one base).  Let L = M 2 ( Z ) and T ( A ) = ( 2 ) A . Then T ( L ) = ( 2 ) M 2 ( Z ) = 2 M 2 ( Z ) and
L / T ( L ) M 2 ( Z ) / 2 M 2 ( Z ) ( Z / 2 Z ) 4
(as additive groups). A convenient digit set is
D = a b c d : a , b , c , d { 0 , 1 } ,
which is finite, contains 0, and represents each coset uniquely. Equivalently, every A M 2 ( Z ) has a unique decomposition
A = d + ( 2 ) W , d D , W M 2 ( Z ) .
4. 
Z F 2 [ x ]  (two-component module, one base).  Let L = Z F 2 [ x ] and define the base endomorphism
T : L L , T ( a , f ) = ( 10 a , x f ) .
Then
T ( L ) = 10 Z x F 2 [ x ] ,
and hence
L / T ( L ) ( Z / 10 Z ) F 2 [ x ] / x F 2 [ x ] ( Z / 10 Z ) F 2
(as additive groups). A convenient digit set is
D = { 0 , 1 , , 9 } × { 0 , 1 } Z F 2 [ x ] ,
which is finite, contains 0, and represents each coset uniquely. Equivalently, every ( a , f ) Z F 2 [ x ] has a unique decomposition
( a , f ) = d + T ( w ) , d D , w Z F 2 [ x ] .
Definition 3
(n-dimensional CNS (multi-base extension of [2])). Let L be a Z -module and let T = ( T 1 , , T n ) be a base family on L, i.e. T i End Z ( L ) are injective, pairwise commuting, and independentin the sense that
T α : = T 1 α 1 T n α n , T α = T β α = β ( α , β N 0 n ) .
Set
I T : = T 1 ( L ) + + T n ( L ) L ,
and assume the quotient L / I T is finite.
A digit set for T is a finite set D L with 0 D such that D is a complete set of representatives of L / I T ; equivalently, for every v L there exists a unique d D with
v d ( mod I T ) .
The pair ( T , D ) is called an n-dimensional number system if every v L admits a finite expansion of the form
v = α F T α ( d α ) , d α D ,
where F N 0 n is a finite set.
Fixing once and for all a monomial order ≺ on N 0 n , we call ( T , D ) an n-dimensional canonical number system (CNS) if the above expansion is unique for every v L when written in normal form (i.e. F consists exactly of those α with d α 0 , and F has a ≺-maximum).
Example 8
(More detailed concrete expansions).
1. 
Z (base 10).
With T ( m ) = 10 m and D = { 0 , 1 , , 9 } ,
58042 = 2 + 10 · 4 + 10 2 · 0 + 10 3 · 8 + 10 4 · 5 = k = 0 4 T k ( d k ) ,
so ( d 0 , d 1 , d 2 , d 3 , d 4 ) = ( 2 , 4 , 0 , 8 , 5 ) .
2. 
Z [ x 1 , x 2 ] (bases 10 , x 1 , x 2 ).
Let T 1 ( f ) = 10 f , T 2 ( f ) = x 1 f , T 3 ( f ) = x 2 f , and D = { 0 , , 9 } . Consider
f ( x 1 , x 2 ) = 123 + 45 x 1 + 6 x 2 + 7 x 1 x 2 3 + 98 x 1 2 x 2 + 305 x 1 3 x 2 2 .
Writing each integer coefficient in base 10 gives
f ( x 1 , x 2 ) = 123 + 45 x 1 + 6 x 2 + 7 x 1 x 2 3 + 98 x 1 2 x 2 + 305 x 1 3 x 2 2 = 3 · 10 0 x 1 0 x 2 0 + 2 · 10 1 x 1 0 x 2 0 + 1 · 10 2 x 1 0 x 2 0 + 5 · 10 0 x 1 1 x 2 0 + 4 · 10 1 x 1 1 x 2 0 + 6 · 10 0 x 1 0 x 2 1 + 7 · 10 0 x 1 1 x 2 3 + 8 · 10 0 x 1 2 x 2 1 + 9 · 10 1 x 1 2 x 2 1 + 5 · 10 0 x 1 3 x 2 2 + 0 · 10 1 x 1 3 x 2 2 + 3 · 10 2 x 1 3 x 2 2 .
Equivalently,
f = a , b , c d a , b , c 10 a x 1 b x 2 c = a , b , c T 1 a T 2 b T 3 c ( d a , b , c ) , d a , b , c D ,
where the nonzero digits are precisely
d 0 , 0 , 0 = 3 , d 1 , 0 , 0 = 2 , d 2 , 0 , 0 = 1 ; d 0 , 1 , 0 = 5 , d 1 , 1 , 0 = 4 ; d 0 , 0 , 1 = 6 ; d 0 , 1 , 3 = 7 ; d 0 , 2 , 1 = 8 , d 1 , 2 , 1 = 9 ; d 0 , 3 , 2 = 5 , d 2 , 3 , 2 = 3 ( and d 1 , 3 , 2 = 0 ) .
3. 
M 2 ( Z ) (base 2 ).
With T ( A ) = ( 2 ) A and D = a b c d : a , b , c , d { 0 , 1 } , the matrix
A = 2 3 1 0
admits the digit expansion
A = 0 1 1 0 + ( 2 ) 1 0 0 0 + ( 2 ) 2 1 1 0 0 + ( 2 ) 3 0 1 0 0 .
[A concrete element and its expansion] Consider the element
r = ( 23017 , 1 + x + x 4 ) Z F 2 [ x ] .
Write
23017 = 7 + 1 · 10 + 0 · 10 2 + 3 · 10 3 + 2 · 10 4 , 1 + x + x 4 = 1 · x 0 + 1 · x 1 + 1 · x 4 .
Hence the digit sequence d k = ( d k , ε k ) D = { 0 , , 9 } × { 0 , 1 } is
( d 0 , d 1 , d 2 , d 3 , d 4 ) = ( 7 , 1 ) , ( 1 , 1 ) , ( 0 , 0 ) , ( 3 , 0 ) , ( 2 , 1 ) .
With T ( a , f ) = ( 10 a , x f ) and b = ( ( 1 , 0 ) , ( 0 , 1 ) ) as in Example 6, we compute
r = k = 0 4 d k , T k b = ( 7 , 1 ) + T ( 1 , 1 ) + T 2 ( 0 , 0 ) + T 3 ( 3 , 0 ) + T 4 ( 2 , 1 ) = ( 7 , 1 ) + ( 10 , x ) + ( 0 , 0 ) + ( 3000 , 0 ) + ( 20000 , x 4 ) = ( 23017 , 1 + x + x 4 ) .
4. 
Z F 2 [ x ] (two-component module, one base).  Let L = Z F 2 [ x ] and define the base endomorphism
T : L L , T ( a , f ) = ( 10 a , x f ) .
Then
T ( L ) = 10 Z x F 2 [ x ] , L / T ( L ) ( Z / 10 Z ) F 2 [ x ] / x F 2 [ x ] ( Z / 10 Z ) F 2 .
A convenient digit set is
D = { 0 , 1 , , 9 } × { 0 , 1 } Z F 2 [ x ] ,
which is finite, contains 0, and represents each coset uniquely. Equivalently, every ( a , f ) Z F 2 [ x ] has a unique decomposition
( a , f ) = d + T ( w ) , d D , w Z F 2 [ x ] .
For example, for
r = ( 23017 , 1 + x + x 4 ) Z F 2 [ x ] ,
one digit expansion (in the sense of a finite T–expansion) is
r = ( 7 , 1 ) + T ( 1 , 1 ) + T 2 ( 0 , 0 ) + T 3 ( 3 , 0 ) + T 4 ( 2 , 1 ) ,
with all digits ( 7 , 1 ) , ( 1 , 1 ) , ( 0 , 0 ) , ( 3 , 0 ) , ( 2 , 1 ) D .
  • Digit folding and a reduced-frame CNS. Lemma 1 shows that when a CNS is built from an expanded block frame ( b i , U b i , , U M 1 b i ) , one can fold each block of M digits into a single polynomial digit in E [ u ] / ( u M ) (with u acting as U on L). Since T U = U T , this yields an equivalent CNS expansion using the smaller frame b , reducing the coordinate dimension from m M to m at the cost of enlarging the digit alphabet. We refer to the resulting system as the folded (dimension-reduced) CNS.
Lemma 1
(Digit folding operation for an n–dimensional CNS). Let E be a (not necessarily commutative) ring, L a left E–module, and let T , U End E ( L ) satisfy T U = U T . Fix a finite base frame b = ( b 1 , , b m ) L m and an integer M 1 . Form the expanded frame
b ˜ : = U 0 b 1 , , U M 1 b 1 ; ; U 0 b m , , U M 1 b m L m M .
For c = ( c 1 , , c s ) E s and v = ( v 1 , , v s ) L s write
c , v : = = 1 s c v L ( left scalar action in L ) .
Let D 1 , , D m E be finite digit alphabets and set
D : = D 1 × × D m , D ˜ : = D M .
Assume ( L , T , b ˜ , D ˜ ) is a CNS in the sense that every r L has a unique finite expansion
r = k = 0 d ˜ k , T k b ˜ , d ˜ k = d k , i , j 1 i m , 0 j < M D ˜ .
Define the folded digit alphabets as formal truncated polynomials
D i : = j = 0 M 1 d j u j | d j D i E [ u ] < M ( 1 i m ) , D : = D 1 × × D m .
Let E [ u ] < M act on L by evaluation at U:
j = 0 M 1 a j u j · v : = j = 0 M 1 a j U j ( v ) ( a j E , v L ) .
(This is well-defined because U End E ( L ) is E–linear.)
Then every r L admits a finite folded expansion with base frame b :
r = k = 0 e k , T k b , e k = ( e k , 1 , , e k , m ) D , e k , i = j = 0 M 1 d k , i , j u j .
If the original expansion with ( b ˜ , D ˜ ) is unique and T is injective, then the folded expansion with ( b , D ) is also unique.
Example 9.
( Z F 2 [ x ] folded to one digit alphabet of size 20) Let
L : = Z F 2 [ x ]
(viewed as a Z –module). Define the single base endomorphism
T : L L , T ( a , f ) : = ( 10 a , x f ) .
Fix the base frame of length 2
b ˜ : = ( b ˜ 1 , b ˜ 2 ) : = ( 1 , 0 ) , ( 0 , 1 ) L 2 .
Then for each n 0 ,
T n b ˜ 1 = ( 10 n , 0 ) , T n b ˜ 2 = ( 0 , x n ) .
(Expanded 2–coordinate digits).  Let the two coordinate digit alphabets be
D 1 : = { 0 , 1 , , 9 } Z , D 2 : = { 0 , 1 } Z ,
and set D ˜ : = D 1 × D 2 . Thus each expanded digit is a pair
( d , ε ) { 0 , , 9 } × { 0 , 1 } .
Every element ( a , f ) L has a finite expansion
( a , f ) = n = 0 d n T n b ˜ 1 + ε n T n b ˜ 2 = n = 0 d n 10 n , ε n x n , ( d n , ε n ) D ˜ ,
obtained by the usual base–10 expansion of a and the coefficient expansion of f in F 2 [ x ] .(Digit folding into one alphabet). Define a folding map
ϕ : { 0 , , 9 } × { 0 , 1 } Δ , ϕ ( d , 0 ) = d , ϕ ( d , 1 ) = i d ,
where
Δ : = { 0 , 1 , , 9 , i 0 , i 1 , , i 9 } .
Let ψ : Δ { 0 , , 9 } × { 0 , 1 } be its inverse, i.e.
ψ ( d ) = ( d , 0 ) , ψ ( i d ) = ( d , 1 ) ( d { 0 , , 9 } ) .
(So Δ is just a relabeling of the product digit set D ˜ ; this is exactly the “digit folding” idea: compress two coordinates into one larger alphabet.)
Define the folded digit set
D : = Δ ( symbols ) .
Given a folded digit δ Δ , write ψ ( δ ) = ( d ( δ ) , ε ( δ ) ) .
Then every ( a , f ) L admits a finite expansion using only one digit alphabet Δ:
( a , f ) = n = 0 d ( δ n ) T n b ˜ 1 + ε ( δ n ) T n b ˜ 2 , δ n Δ .
Equivalently, in coordinates,
( a , f ) = n = 0 d ( δ n ) 10 n , ε ( δ n ) x n .
Concrete computation.  Let
( a , f ) = ( 37245 , 1 + x 2 + x 5 ) L .
Choose expanded digits ( d n , ε n ) by
( d 0 , d 1 , d 2 , d 3 , d 4 , d 5 ) = ( 5 , 4 , 2 , 7 , 3 , 0 ) , ( ε 0 , ε 1 , ε 2 , ε 3 , ε 4 , ε 5 ) = ( 1 , 0 , 1 , 0 , 0 , 1 ) .
Fold them into δ n : = ϕ ( d n , ε n ) Δ :
( δ 0 , δ 1 , δ 2 , δ 3 , δ 4 , δ 5 ) = ( i 5 , 4 , i 2 , 7 , 3 , i 0 ) .
Then
( 37245 , 1 + x 2 + x 5 ) = n = 0 5 d ( δ n ) 10 n , ε ( δ n ) x n = ( 5 , 1 ) + T ( 4 , 0 ) + T 2 ( 2 , 1 ) + T 3 ( 7 , 0 ) + T 4 ( 3 , 0 ) + T 5 ( 0 , 1 ) ,
where the only digits used are δ n Δ .
  • Uniqueness.  If
n = 0 d ( δ n ) 10 n , ε ( δ n ) x n = ( 0 , 0 ) ,
then n d ( δ n ) 10 n = 0 forces all d ( δ n ) = 0 , and n ε ( δ n ) x n = 0 forces all ε ( δ n ) = 0 in F 2 [ x ] , hence all δ n are the zero digit. Therefore the folded expansion is unique.
Definition 4
(Digit–folding reduction; folding–irreducible CNS). Fix a class of digit–folding moves as in Lemma 1. A digit–folding reduction of an n–dimensional CNS is a finite sequence
( L , T ( 0 ) , b ( 0 ) , D ( 0 ) ) ( L , T ( 1 ) , b ( 1 ) , D ( 1 ) ) ( L , T ( s ) , b ( s ) , D ( s ) ) ,
where each arrow is obtained by applying Lemma 1 with some commuting endomorphism U and some integer M 2 , so that the frame size strictly decreases at each step.
We call an n–dimensional CNS folding–irreducible (or fully folded) if no nontrivial digit–folding move applies to it, i.e. there do not exist U End E ( L ) commuting with the base shift(s) and an integer M 2 for which Lemma 1 yields a further compression of the base frame.
A fully folded form of a given CNS is any folding–irreducible CNS obtained from it by a digit–folding reduction.
Remark 2.
Every digit–folding reduction terminates: each application of Lemma 1 replaces an m M –frame by an m–frame with M 2 , hence strictly decreases the (positive integer) frame size. Therefore no infinite sequence of digit–folding reductions exists.
Remark 3.
A fully folded form need not be unique in general: different choices of folding directions (choices of U and the associated finite tower structure) or different orders of folding may lead to non-isomorphic folding–irreducible presentations. If a canonical normal form is desired, one may fix a deterministic folding strategy (e.g. greedy in M, then lexicographic in the chosen towers).

3. The Question and Some Clues

Remark 4
(Representation scope and guiding questions). A central motivation for introducing an n–dimensional number system (and its canonical variant) is to understand its representation scope. Informally, this asks: for which modules (or rings) does the proposed positional mechanism actually represent every element by a finite digit expansion, and when is such an expansion unique? To make this precise, we adopt the following terminology.
Definition 5
(Representation scope). Fix n N and a class C of Z –modules. For L C , let T = ( T 1 , , T n ) be a base family on L and let D L be a finite digit set (a transversal of L / I T , where I T = i = 1 n T i ( L ) ). Write T α : = T 1 α 1 T n α n .
  • We define the representation scope of n–dimensional number systems on C to be
RS n ( C ) : = { ( L , T , D ) | L C , v L , F N 0 n finite , ( d α ) α F D : v = α F T α ( d α ) } .
In words, ( L , T , D ) RS n ( C ) iff every element of L admits a finite digit expansion in the places { T α } with digits from D.
  • If a monomial order ≺ on N 0 n is fixed, we define the canonical representation scope by
RS n CNS ( C ) : = ( L , T , D ) RS n ( C ) | the - normal form expansion is unique .
Remark. For notational convenience, we may adjoin T 0 = Id L to a base family so the “0th place” is treated uniformly with shifted places. This does not change the digit theory: digits are still taken from a finite transversal of L / i = 1 n T i ( L ) (we do not quotient by T 0 ( L ) = L ).
Definition 6.
(n–dimensional CNS [ Id ] (identity–adjoined form)) Let L be a Z –module and let ( T , D ) be an n–dimensional CNS on L in the sense of Definition [n–dimensional CNS]. Define the identity–adjoined base family
T [ Id ] : = ( Id L , T 1 , , T n ) .
We call ( T [ Id ] , D ) ann–dimensional CNS [ Id ]  if it satisfies the same expansion and uniqueness requirements as ( T , D ) , with the understanding that the digit set is still chosen as a transversal of
L / i = 1 n T i ( L ) ( so we do not quotient by Id L ( L ) = L ) .
Remark 5.
The notation CNS [ Id ] is convenient when the digits are taken in a coefficient field, e.g. F p . In typical base families that include a prime p (so coefficients are reduced modulo p), one may view the digit alphabet as F p itself (identified with { 0 , 1 , , p 1 } ) and regard these coefficient digits as acting at the 0th place via Id L .
Definition 7.
( RS n ( C ) [ Id ] (identity–closed representation scope)) Let RS n ( C ) denote the representation scope of n–dimensional number systems on C (as defined previously). For each ( L , T , D ) RS n ( C ) with T = ( T 1 , , T n ) , write
T [ Id ] : = ( Id L , T 1 , , T n ) .
We define the identity–closed representation scope by
RS n ( C ) [ Id ] : = RS n ( C ) ( L , T [ Id ] , D ) | ( L , T , D ) RS n ( C ) .
Thus RS n ( C ) [ Id ] contains both the original n–dimensional number systems and their identity–adjoined presentations (CNS [ Id ] ).
Proposition 1
(Direct products of n–dimensional number systems). Let L 1 , L 2 be Z –modules. Suppose
( L 1 , T , D 1 ) and ( L 2 , S , D 2 )
are n–dimensional number systems, where
T = ( T 1 , , T n ) End Z ( L 1 ) , S = ( S 1 , , S n ) End Z ( L 2 ) ,
and D 1 L 1 , D 2 L 2 are digit sets (transversals of the corresponding quotients). Define
L : = L 1 × L 2 , U = ( U 1 , , U n ) End Z ( L ) by U i : = T i × S i ,
i.e. U i ( x , y ) = ( T i x , S i y ) , and set
D : = D 1 × D 2 L .
Then ( L , U , D ) is an n–dimensional number system.
Moreover, if ( L 1 , T , D 1 ) and ( L 2 , S , D 2 ) are n–dimensional CNS (with respect to the same fixed monomial order on N 0 n ), then ( L , U , D ) is an n–dimensional CNS.
Finally, if one (or both) of the factors is presented in the identity–adjoined form CNS [ Id ] , then the product can be presented as CNS [ Id ] on L by adjoining Id L ; forgetting Id recovers an ordinary CNS presentation.
Proof. 
Step 1: U is a base family. Each U i is injective because T i and S i are injective. For commutativity, for all i , j and ( x , y ) L ,
U i U j ( x , y ) = ( T i T j x , S i S j y ) = ( T j T i x , S j S i y ) = U j U i ( x , y ) ,
since the T i commute pairwise and the S i commute pairwise.
For independence, suppose U α = U β where U α : = U 1 α 1 U n α n . Applying to ( x , 0 ) gives
( T α x , 0 ) = U α ( x , 0 ) = U β ( x , 0 ) = ( T β x , 0 ) ( x L 1 ) ,
hence T α = T β , so α = β by independence of T . Thus U is independent.
Step 2: digit quotient and digit set. Let
I T : = i = 1 n T i ( L 1 ) , I S : = i = 1 n S i ( L 2 ) , I U : = i = 1 n U i ( L ) .
Then
I U = i = 1 n T i ( L 1 ) × S i ( L 2 ) = i = 1 n T i ( L 1 ) × i = 1 n S i ( L 2 ) = I T × I S .
Hence
L / I U ( L 1 / I T ) × ( L 2 / I S ) ,
so if D 1 and D 2 represent cosets uniquely in L 1 / I T and L 2 / I S , then D = D 1 × D 2 represents cosets uniquely in L / I U .
Step 3: existence of expansions. Take ( v 1 , v 2 ) L . Since ( L 1 , T , D 1 ) is an n–dimensional number system, there exist digits ( d α ) D 1 such that
v 1 = α T α ( d α ) .
Similarly, there exist digits ( e α ) D 2 such that
v 2 = α S α ( e α ) .
Therefore
( v 1 , v 2 ) = α T α ( d α ) , S α ( e α ) = α U α ( d α , e α ) ,
with ( d α , e α ) D 1 × D 2 = D , proving that ( L , U , D ) is an n–dimensional number system.
Step 4: uniqueness (CNS case). Assume both factors are n–dimensional CNS (unique normal form with respect to the same monomial order). If
α U α ( δ α ) = α U α ( δ α ) ( δ α , δ α D 1 × D 2 ) ,
then comparing coordinates gives equality of the corresponding expansions in L 1 and in L 2 . By uniqueness in each factor, δ α = δ α for all α , hence the product expansion is unique, so ( L , U , D ) is a CNS.
Step 5: the CNS [ Id ] presentation. If one wishes to work in the identity–adjoined notation, adjoin Id L to U to obtain U [ Id ] : = ( Id L , U 1 , , U n ) . This does not change the digit theory because digits are still taken modulo i = 1 n U i ( L ) = I U (one does not quotient by Id L ( L ) = L ). Thus the product admits a CNS [ Id ] presentation; forgetting Id L recovers the ordinary CNS presentation. □
Remark 6.
(Examples in RS n ( C ) [ Id ] and a guiding hypothesis) Let C be the class of Z –modules (or rings viewed as Z –modules). By the constructions above, the following standard objects admit n–dimensional number–system presentations (and hence lie in the identity–closed scope RS n ( C ) [ Id ] ):
Z , Z [ x 1 , , x m ] , F p , F p [ x ] ,
together with finite direct sums of such systems (by the direct–product closure proposition). In particular, combinations such as
Z F 2 [ x ]
can be represented by choosing compatible base maps on each component and taking the product digit set; adjoining Id yields the corresponding CNS [ Id ] notation.
  • Motivation of a new hypothesis.  Since many rings of interest are finitely generated Z –algebras, there exists a surjective homomorphism
ϕ : Z [ x 1 , , x m ] R ,
and hence a standard presentation
R Z [ x 1 , , x m ] / ker ( ϕ ) .
Moreover, the basic building blocks Z , Z [ x 1 , , x m ] , and their typical quotients naturally support digit–expansion structures in our framework. It is therefore reasonable to expect that such a finite–generators presentation should place R inside the identity–closed representation scope RS n ( C ) [ Id ] . This leads to the following hypothesis.
Assumption 1
(Guiding hypothesis). If a ring R admits a presentation as a finitely generated Z –algebra,
R Z [ x 1 , , x m ] / ker ( ϕ )
for some surjection ϕ : Z [ x 1 , , x m ] R , then R admits an n–dimensional number–system presentation (possibly in the identity–adjoined form), i.e.
R RS n ( C ) [ Id ] for some n .
  • Emphasize that RS n ( C ) [ Id ] is not restricted to commutative settings: for instance, noncommutative rings such as M 2 ( Z ) (with base given by left multiplication by 2 and a finite digit set modulo 2 M 2 ( Z ) ) also admit CNS [ Id ] presentations, and hence lie in RS n ( C ) [ Id ] .
  • We also note that RS n ( C ) [ Id ] does not automatically contain every ring one might consider: for example, noncommutative free algebras such as Z x 1 , x 2 and fields like Q fall outside the present scope under our standing digit–set/quotient requirements.
Proposition 2.
( Q lies outside RS n ( C ) [ Id ] ) For every n 1 , the field Q does not admit an n–dimensional number–system presentation of the type used in this paper (hence Q RS n ( C ) [ Id ] ).
Proof. 
Let f : Q Q be any Z –endomorphism (additive group homomorphism). Set q : = f ( 1 ) Q . Then for every integer m we have f ( m ) = m q . Moreover, for n 1 ,
q = f ( 1 ) = f n · 1 n = n f 1 n f 1 n = q n ,
and hence for every m / n Q ,
f m n = m f 1 n = m q n = q · m n .
Thus every Z –endomorphism of Q is multiplication by a rational number.
In particular, if T : Q Q is injective, then T ( x ) = q x with q 0 , so T is surjective and T ( Q ) = Q . Therefore, for any base family T = ( T 1 , , T n ) of injective endomorphisms on Q , we have
I T = i = 1 n T i ( Q ) = Q , hence Q / I T = 0 .
Consequently the only possible digit transversal is D = { 0 } , so any digit expansion evaluates to 0 and cannot represent 1 Q . Hence Q is not representable in the sense of RS n ( C ) [ Id ] . □
Proposition 3
(The free algebra Z x 1 , x 2 is not covered by the commuting multiplication–base model). Let R = Z x 1 , x 2 be the (noncommutative) free Z –algebra on two generators. Consider the natural “generator–multiplication” choice of base maps
T 1 ( r ) = x 1 r , T 2 ( r ) = x 2 r ( r R ) .
Then ( T 1 , T 2 ) cannot be a base family in the sense of Definition [Base family] (hence R is not in the portion of RS n ( C ) [ Id ] arising from finitely many commuting multiplication–base maps).
Proof. 
A base family is required to be finite and pairwise commuting. However, for every r R ,
T 1 T 2 ( r ) = x 1 ( x 2 r ) = ( x 1 x 2 ) r , T 2 T 1 ( r ) = x 2 ( x 1 r ) = ( x 2 x 1 ) r .
Since R is the free algebra, the words x 1 x 2 and x 2 x 1 are distinct, hence x 1 x 2 x 2 x 1 in R, and therefore T 1 T 2 T 2 T 1 . Thus the two independent “shift directions” coming from the two generators cannot simultaneously appear in a commuting base family. Consequently, the standard finite–base approach (using only finitely many independent generator multiplications) does not apply to Z x 1 , x 2 . □

References

  1. Shigeki Akiyama; Attila Pethő. On canonical number systems. Theoretical Computer Science 2002, vol. 270(no. 1–2), 921–933. [Google Scholar] [CrossRef]
  2. Shigeki Akiyama; Attila Pethő. On a canonical number systems. Theoretical Computer Science 2002, 270, 921–933. [Google Scholar] [CrossRef]
  3. Attila Pethő; Péter Varga. Canonical number systems over imaginary quadratic Euclidean domains. Colloquium Mathematicum 2017, 146(no. 2), 165–186. [Google Scholar] [CrossRef]
  4. Christiaan E. van de Woestijne. Number systems and the Chinese Remainder Theorem. Osaka Journal of Mathematics 2004, vol. 41(no. 2), 327–351. [Google Scholar]
  5. Béla Kovács; Attila Pethő. Number systems in integral domains, especially in orders of algebraic number fields. Acta Sci. Math. (Szeged) 1991, 55(no. 3–4), 287–299. [Google Scholar]
  6. Béla Kovács; Attila Pethő. On a representation of algebraic integers. Studia Sci. Math. Hungar. 1992, 27(no. 1–2), 169–172. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated