Search arXivSearch

arXiv · 2603.21157

Growth of infinite frieze patterns of affine type

Abstract

We analyse the growth coefficients of infinite frieze patterns arising from cluster algebras using cluster modular groups and cluster categories. For a fixed cluster category of affine type, we prove that the collection of infinite frieze patterns given by both the homogeneous and non-homogeneous stable tubes all have the same growth coefficients. We also derive and verify an explicit formula for the $k$-th growth coefficient, expressed directly in terms of data from homogeneous tubes, or, alternatively, from appropriate elements of the corresponding cluster algebra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karin Baur, Anna Felikson, Deepanshu Prasad, Pavel Tumarkin, Emine Yıldırım. 2026-03-22. Growth of infinite frieze patterns of affine type. https://arxiv.org/abs/2603.21157

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