English

On Christoffel words & their lexicographic array

Combinatorics 2025-06-27 v4

Abstract

By a Christoffel matrix we mean a n×nn\times n matrix corresponding to the lexicographic array of a Christoffel word of length n.n. In this note we show that if RR is an integral domain, then the product of two Christoffel matrices over RR is commutative and is a Christoffel matrix over R.R. Furthermore, if a Christoffel matrix over RR is invertible, then its inverse is a Christoffel matrix over R.R. Consequently, the set GCn(R)GC_n(R) of all n×nn\times n invertible Christoffel matrices over RR forms an abelian subgroup of GLn(R).GL_n(R). The subset of GCn(R)GC_n(R) consisting all invertible Christoffel matrices having some element aa on the diagonal and bb elsewhere (with a,bRa,b \in R distinct) forms a subgroup HH of GCn(R).GC_n(R). If RR is a field, then the quotient GCn(R)/HGC_n(R)/H is isomorphic to (Z/nZ)×,(\Z/nZ)^\times, the multiplicative group of integers modulo n.n. It follows that for each finite field FF and each finite abelian group G,G, there exists n2n\geq 2 and a faithful representation GGLn(F)G\rightarrow GL_n(F) consisting entirely of n×nn\times n (invertible) Christoffel matrices over F.F. We describe the structure of GCn(Z/2Z).GC_n(\Z/2\Z).

Keywords

Cite

@article{arxiv.2409.07974,
  title  = {On Christoffel words & their lexicographic array},
  author = {Luca Q. Zamboni},
  journal= {arXiv preprint arXiv:2409.07974},
  year   = {2025}
}
R2 v1 2026-06-28T18:42:24.069Z