2000 character limit reached
Éléments de comptage sur les générateurs du groupe modulaire et les -quiddités
Published 3 Feb 2025 in math.CO | (2502.01328v1)
Abstract: The aim of this article is to count the -tuples of positive integers solutions of the equation $\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 is equal to the generators of the modular group $S=\begin{pmatrix} 0 & -1 \[4pt] 1 & 0 \end{pmatrix}$ and $T=\begin{pmatrix} 1 & 1 \[4pt] 0 & 1 \end{pmatrix}$. To count these elements, we will study the -quiddities, which are the solutions of the equation in the case (related to Coxeter's friezes), whose last component is fixed.
Paper Prompts
Sign up for free to create and run prompts on this paper.