Search arXivSearch

arXiv · 2106.06679

Periodic Infinite Frieze Patterns of Type $Λ_{p_1,\ldots,p_n}$ and Dissections on Annuli

Abstract

Finite frieze patterns with entries in $\mathbb{Z}[λ_{p_1},\ldots,λ_{p_s}]$ where $\{p_1,\ldots,p_s\} \subseteq \mathbb{Z}_{\geq 3}$ and $λ_p = 2 \cos(π/p)$ were shown to have a connection to dissected polygons by Holm and Jorgensen. We extend their work by studying the connection between infinite frieze patterns with such entries and dissections of annuli and once-punctured discs. We give an algorithm to determine whether a frieze pattern with entries in $\mathbb{Z}[λ_{p_1},\ldots,λ_{p_s}]$, finite or infinite, comes from a dissected surface. We introduce quotient dissections as a realization for some frieze patterns unrealizable by an ordinary dissection. We also introduce two combinatorial interpretations for entries of frieze patterns from dissected surfaces. These interpretations are a generalization of matchings introduced by Broline, Crowe, and Isaacs for finite frieze patterns over $\mathbb{Z}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Esther Banaian, Jiuqi Chen. 2021-06-12. Periodic Infinite Frieze Patterns of Type $Λ_{p_1,\ldots,p_n}$ and Dissections on Annuli. https://arxiv.org/abs/2106.06679

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