Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1703.09953

Geometric realizations of the accordion complex of a dissection

Thibault Manneville·Vincent Pilaud
View original source ↗Read source document ↗Export metadata ↓

Abstract

Consider $2n$ points on the unit circle and a reference dissection $\mathrm{D}_\circ$ of the convex hull of the odd points. The accordion complex of $\mathrm{D}_\circ$ is the simplicial complex of non-crossing subsets of the diagonals with even endpoints that cross a connected subset of diagonals of $\mathrm{D}_\circ$. In particular, this complex is an associahedron when $\mathrm{D}_\circ$ is a triangulation and a Stokes complex when $\mathrm{D}_\circ$ is a quadrangulation. In this paper, we provide geometric realizations (by polytopes and fans) of the accordion complex of any reference dissection $\mathrm{D}_\circ$, generalizing known constructions arising from cluster algebras.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thibault Manneville, Vincent Pilaud. 2018-03-29. Geometric realizations of the accordion complex of a dissection. https://doi.org/10.1007/s00454-018-0004-2

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↗