On Christoffel words & their lexicographic array

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…