English
Related papers

Related papers: A combinatorial model for tame frieze patterns

200 papers

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

Combinatorics · Mathematics 2023-09-07 Flavien Mabilat

In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…

Combinatorics · Mathematics 2024-12-03 Flavien Mabilat

We use a class of Farey graphs introduced by the final three authors to enumerate the tame friezes over $\mathbb{Z}/n\mathbb{Z}$. Using the same strategy we enumerate the tame regular friezes over $\mathbb{Z}/n\mathbb{Z}$, thereby reproving…

Combinatorics · Mathematics 2024-11-01 Sammy Benzaira , Ian Short , Matty van Son , Andrei Zabolotskii

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

Combinatorics · Mathematics 2025-03-10 Flavien Mabilat

In this article we consider tame $ SL_3 $-friezes that arise by specializing a cluster of Pl\"ucker variables in the coordinate ring of the Grassmannian $ \mathscr{G}(3,n) $ to $ 1 $. We show how to calculate arbitrary entries of such…

Combinatorics · Mathematics 2024-04-16 Lucas Surmann

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

Geometric Topology · Mathematics 2014-10-01 Juan Gonzalez-Meneses , Bert Wiest

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

Geometric Topology · Mathematics 2012-03-13 Justin Malestein , Louis Theran

Frieze patterns form a nexus between algebra, combinatorics, and geometry. T-paths with respect to triangulations of surfaces have been used to obtain expansion formulae for cluster variables. This paper will introduce the concepts of weak…

Combinatorics · Mathematics 2020-05-14 Ilke Canakci , Peter Jorgensen

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

Rings and Algebras · Mathematics 2026-05-14 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

We define the notion of infinite friezes of positive integers as a variation of Conway-Coxeter frieze patterns and study their properties. We introduce useful gluing and cutting operations on infinite friezes. It turns out that…

Combinatorics · Mathematics 2015-08-04 Manuela Tschabold

We consider the class of all commutative reduced rings for which there exists a finite subset T of A such that all projections on quotients by prime ideals of A are surjective when restricted to T. A complete structure theorem is given for…

Commutative Algebra · Mathematics 2009-03-17 Antonio Avilés

A ring R is said to be of stable range 1.5 if for each a, b from R and nonzero c from R satisfying aR + bR + cR = R there exists r from R such that (a + br)R + cR = R. Let R be a commutative domain in which all finitely generated ideals are…

Rings and Algebras · Mathematics 2018-06-14 Victor A. Bovdi , Volodymyr P. Shchedryk

A frieze in the modern sense is a map from the set of objects of a triangulated category $\mathsf{C}$ to some ring. A frieze $X$ is characterised by the property that if $\tau x\rightarrow y\rightarrow x$ is an Auslander-Reiten triangle in…

Representation Theory · Mathematics 2016-10-04 David Pescod

Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that…

Functional Analysis · Mathematics 2026-05-05 Chad Berner

We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…

Combinatorics · Mathematics 2019-01-07 Michael J. Catanzaro , Matthew J. Zabka

Let $Z$ be an affine algebraic variety and $X$ be a smooth flexible variety. We develop some criteria under which $Z$ admits a closed embedding into $X$. In particular, we show that if $X$ is isomorphic (as an algebraic variety) to a…

Algebraic Geometry · Mathematics 2023-07-04 Shulim Kaliman

In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we…

Representation Theory · Mathematics 2017-05-16 Jacob Turner

We explain a method, inspired by control theory model reduction and interpolation theory, that rigorously establishes the types of coarse graining that are appropriate for systems with quadratic, generalized Hamiltonians. For such systems,…

Statistical Mechanics · Physics 2007-05-23 David E. Reynolds

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

Formal Languages and Automata Theory · Computer Science 2018-04-06 Francesco Dolce , Dominique Perrin , Antonio Restivo , Christophe Reutenauer , Giuseppina Rindone