Entiers monomialement irr\'eductibles
Abstract
In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes), modulo an integer N, whose components are identical and minimal for this property. Our objective is to study the integers N for which all these solutions have a certain irreducibility property.
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.