English

Quelques \'el\'ements de combinatoire des matrices de $SL_{2}(\mathbb{Z})$

Combinatorics 2021-06-09 v5

Abstract

A Theorem of V.Ovsienko characterizes sequences of positive integers (a1,a2,,an)(a_1,a_2,\ldots,a_n) such that the (2×2)(2\times2)-matrix (an110)(a1110)\begin{pmatrix} a_n & -1 \\ 1 & 0 \end{pmatrix}\cdots \begin{pmatrix} a_1 & -1 \\ 1 & 0 \end{pmatrix} is equal to ±Id\pm Id. In this paper, we study this equation when we replace ±Id\pm Id by ±M\pm M. In particular, we give a combinatorial description of the solutions of this equation in terms of dissections of convex polygons in the cases M=(0110)M=\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} and M=(1101)M=\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}.

Keywords

Cite

@article{arxiv.2004.14007,
  title  = {Quelques \'el\'ements de combinatoire des matrices de $SL_{2}(\mathbb{Z})$},
  author = {Flavien Mabilat},
  journal= {arXiv preprint arXiv:2004.14007},
  year   = {2021}
}

Comments

in French

R2 v1 2026-06-23T15:10:32.072Z