Search arXivSearch

arXiv · 2311.03073

Y-frieze patterns

Abstract

Motivated by cluster ensembles, we introduce a new variant of frieze patterns associated to acyclic cluster algebras, which we call ${\bf Y}\textit{-frieze patterns}$. Using the mutation rules for ${\bf Y}$-variables, we define a large class of ${\bf Y}$-frieze patterns called $\textit{unitary }{\bf Y}\textit{-frieze patterns}$, and show that the ensemble map induces a map from (unitary) frieze patterns to (unitary) ${\bf Y}$-frieze patterns. In rank 2, we show that ${\bf Y}$-frieze patterns are (associated to) friezes of generalised cluster algebras. In finite type (not necessarily rank 2), we show that ${\bf Y}$-frieze patterns share the same symmetries as frieze patterns, and prove that their number is finite.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine de Saint Germain. 2024-01-09. Y-frieze patterns. https://arxiv.org/abs/2311.03073

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO