Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quelques éléments de combinatoire des matrices de $SL_{2}(\mathbb{Z})$

Published 29 Apr 2020 in math.CO | (2004.14007v5)

Abstract: A Theorem of V.Ovsienko characterizes sequences of positive integers $(a_1,a_2,\ldots,a_n)$ such that the $(2\times2)$-matrix $\begin{pmatrix} a_n & -1 \ 1 & 0 \end{pmatrix}\cdots \begin{pmatrix} a_1 & -1 \ 1 & 0 \end{pmatrix}$ is equal to $\pm Id$. In this paper, we study this equation when we replace $\pm Id$ by $\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=\begin{pmatrix} 0 & -1 \ 1 & 0 \end{pmatrix}$ and $M=\begin{pmatrix} 1 & 1 \ 0 & 1 \end{pmatrix}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.