Search arXivSearch

arXiv · 2604.12547

Maximal size of irreducible $λ$-quiddities over polynomial and formal power series rings

Abstract

The study of the combinatorics of the modular group and of Coxeter's friezes naturally leads to the investigation of a matrix equation, sometimes referred to as the Conway-Coxeter equation. The solutions of size $n$ of this equation, called $λ$-quiddities, are $n$-tuples of elements of a given ring $B$. A detailled understanding of these objects relies on the notion of irreducible solutions, from which all $λ$-quiddities can be reconstructed. One of the central questions that naturally arises in this context is whether the irreducible $λ$-quiddities over $B$ have bounded size, and, if so, how to determine such a bound. In this paper, we aim to list results that address this question in the case of polynomial rings $A[X]$ and $\mathbb{K}[X]$, where $A$ is a finite commutative unitary ring and $\mathbb{K}$ is a commutative field. Moreover, the stated results will also make it possible to treat easily many situations in which $A$ is infinite. Finally, we shall give a complete answer to the initial question for all rings of formal power series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Flavien Mabilat. 2026-04-14. Maximal size of irreducible $λ$-quiddities over polynomial and formal power series rings. https://arxiv.org/abs/2604.12547

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO