Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.06642

Multiplicative Inequalities In Cluster Algebras Of Finite Type

Michael Gekhtman·Zachary Greenberg·Daniel Soskin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Generalizing the notion of a multiplicative inequality among minors of a totally positive matrix, we describe, over full rank cluster algebras of finite type, the cone of Laurent monomials in cluster variables that are bounded as a real-valued function on the positive locus of the cluster variety. We prove that the extreme rays of this cone are the u-variables of the cluster algebra. Using this description, we prove that all bounded ratios are bounded by 1 and give a sufficient condition for all such ratios to be subtraction free. This allows us to show in Gr(2, n), Gr(3, 6), Gr(3, 7), Gr(3, 8) that every bounded Laurent monomial in Plücker coordinates factors into a positive integer combination of so-called primitive ratios. In Gr(4, 8) this factorization does not exists, but we provide the full list of extreme rays of the cone of bounded Laurent monomials in Plücker coordinates.

Explore related subjects

math.COmath.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Gekhtman, Zachary Greenberg, Daniel Soskin. 2024-09-10. Multiplicative Inequalities In Cluster Algebras Of Finite Type. https://arxiv.org/abs/2409.06642

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗