Search arXivSearch

arXiv · 2212.14265

Realizations of multiassociahedra via rigidity

Abstract

Let $Δ_k(n)$ denote the simplicial complex of $(k+1)$-crossing-free subsets of edges in $\binom{[n]}{2}$. Here $k,n\in \mathbb N$ and $n\ge 2k+1$. Jonsson (2003) proved that (neglecting the short edges that cannot be part of any $(k+1)$-crossing), $Δ_k(n)$ is a shellable sphere of dimension $k(n-2k-1)-1$, and conjectured it to be polytopal. The same result and question arose in the work of Knutson and Miller (2004) on subword complexes. Despite considerable effort, the only values of $(k,n)$ for which the conjecture is known to hold are $n\le 2k+3$ (Pilaud and Santos, 2012) and $(2,8)$ (Bokowski and Pilaud, 2009). Using ideas from rigidity theory and choosing points along the moment curve we realize $Δ_k(n)$ as a polytope for $(k,n)\in \{(2,9), (2,10) , (3,10)\}$. We also realize it as a simplicial fan for all $n\le 13$ and arbitrary $k$, except the pairs $(3,12)$ and $(3,13)$. Finally, we also show that for $k\ge 3$ and $n\ge 2k+6$ no choice of points can realize $Δ_k(n)$ via bar-and-joint rigidity with points along the moment curve or, more generally, via cofactor rigidity with arbitrary points in convex position.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Crespo Ruiz, Francisco Santos. 2024-10-27. Realizations of multiassociahedra via rigidity. https://doi.org/10.1007/s00454-024-00698-y

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