English

\'El\'ements de comptage sur les g\'en\'erateurs du groupe modulaire et les $\lambda$-quiddit\'es

Combinatorics 2025-02-04 v1

Abstract

The aim of this article is to count the nn-tuples of positive integers (a1,,an)(a_{1},\ldots,a_{n}) solutions of the equation (an110)(an1110)(a1110)=±M\begin{pmatrix} a_{n} & -1 \\[4pt] 1 & 0 \end{pmatrix} \begin{pmatrix} a_{n-1} & -1 \\[4pt] 1 & 0 \end{pmatrix} \cdots \begin{pmatrix} a_{1} & -1 \\[4pt] 1 & 0 \end{pmatrix}=\pm M when MM is equal to the generators of the modular group S=(0110)S=\begin{pmatrix} 0 & -1 \\[4pt] 1 & 0 \end{pmatrix} and T=(1101)T=\begin{pmatrix} 1 & 1 \\[4pt] 0 & 1 \end{pmatrix}. To count these elements, we will study the λ\lambda-quiddities, which are the solutions of the equation in the case M=IdM=Id (related to Coxeter's friezes), whose last component is fixed.

Keywords

Cite

@article{arxiv.2502.01328,
  title  = {\'El\'ements de comptage sur les g\'en\'erateurs du groupe modulaire et les $\lambda$-quiddit\'es},
  author = {Flavien Mabilat},
  journal= {arXiv preprint arXiv:2502.01328},
  year   = {2025}
}

Comments

in French language