Compatibility fans for graphical nested complexes

DOI10.1016/J.JCTA.2017.02.004MaRDI QIDQ2397100zbMATH OpenOpenAlexFDO

Authors T. Manneville, Vincent Pilaud

Publication date 29 May 2017

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.07152

zbMATH Keywords

finite type cluster algebrasgraph associahedracompatibility degreescompatibility fans

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of simplicial complexes (05E45)

Abstract: Graph associahedra are natural generalizations of the classical associahedra. They provide polytopal realizations of the nested complex of a graph $G$, defined as the simplicial complex whose vertices are the tubes (i.e. connected induced subgraphs) of $G$ and whose faces are the tubings (i.e. collections of pairwise nested or non-adjacent tubes) of $G$. The constructions of M. Carr and S. Devadoss, of A. Postnikov, and of A. Zelevinsky for graph associahedra are all based on the nested fan which coarsens the normal fan of the permutahedron. In view of the combinatorial and geometric variety of simplicial fan realizations of the classical associahedra, it is tempting to search for alternative fans realizing graphical nested complexes. Motivated by the analogy between finite type cluster complexes and graphical nested complexes, we transpose in this paper S. Fomin and A. Zelevinsky's construction of compatibility fans from the former to the latter setting. For this, we define a compatibility degree between two tubes of a graph $G$. Our main result asserts that the compatibility vectors of all tubes of $G$ with respect to an arbitrary maximal tubing on $G$ support a complete simplicial fan realizing the nested complex of $G$. In particular, when the graph $G$ is reduced to a path, our compatibility degree lies in $-1,0,1$ and we recover F. Santos' Catalan many simplicial fan realizations of the associahedron.

Recommendations

• Compatibility fans realizing graphical nested complexes
• Fan-planar graphs: combinatorial properties and complexity results
• On fans in multigraphs
• Fan-planarity: properties and complexity
• Compact compatible topologies for posets and graphs
• Compatibility in a graph-theoretic setting
• On fan-crossing graphs
• Gracefulness of some graphs related to fans
• Fan-planar graphs
• Complexes of graph homomorphisms

Cites work

• scientific article; zbMATH DE number 2209740 (Why is no real title available?)
• A realization of graph associahedra
• Associahedra via spines
• Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
• Brick polytopes of spherical subword complexes and generalized associahedra
• Cambrian Hopf algebras
• Cambrian fans.
• Cambrian lattices.
• Cluster algebras IV: Coefficients
• Cluster algebras. I: Foundations
• Cluster algebras. II: Finite type classification
• Constructions and complexity of secondary polytopes
• Convex polytopes from nested posets
• Coxeter complexes and graph-associahedra
• Cubical realizations of flag nestohedra and proof of Gal's conjecture for them
• Deformations of bordered surfaces and convex polytopes
• Denominator vectors and compatibility degrees in cluster algebras of finite type
• Discriminants, resultants, and multidimensional determinants
• Graph of triangulations of a convex polygon and tree of triangulations
• Homotopy Associativity of H-Spaces. I
• Hopf algebra of the planar binary trees
• Hopf algebras of permutahedra, associahedra and hypercubes
• Isometry classes of generalized associahedra
• Lattice congruences of the weak order.
• Laurent phenomenon algebras
• Lectures on Polytopes
• Many non-equivalent realizations of the associahedron
• Matroid polytopes, nested sets and Bergman fans
• Monoïdes préordonnés et chaînes de Malcev
• Nested complexes and their polyhedral realizations
• On the rotation distance between binary trees
• Permutahedra and associahedra: generalized associahedra from the geometry of finite reflection groups
• Permutahedra and generalized associahedra.
• Permutohedra, Associahedra, and Beyond
• Polyhedral models for generalized associahedra via Coxeter elements
• Polytopal Realizations of Generalized Associahedra
• Realization of the Stasheff polytope
• Realizations of the associahedron and cyclohedron
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Signed tree associahedra
• The algebra of binary search trees
• The associahedron and triangulations of the \(n\)-gon
• The brick polytope of a sorting network
• The centers of gravity of the associahedron and of the permutahedron are the same
• The diameter of associahedra
• Triangulations. Structures for algorithms and applications
• Universal geometric cluster algebras
• Vertex barycenter of generalized associahedra
• Wonderful models of subspace arrangements
• \(Y\)-systems and generalized associahedra

Cited in

(12)

• Coxeter submodular functions and deformations of Coxeter permutahedra
• On the topology of nested set complexes
• Partial permutation and alternating sign matrix polytopes
• Partial permutation and alternating sign matrix polytopes
• Compatibility fans realizing graphical nested complexes
• Fan-planarity: properties and complexity
• Graph invariants and Betti numbers of real toric manifolds
• Species substitution, graph suspension, and graded Hopf algebras of painted tree polytopes
• Deformation cones of graph associahedra and nestohedra
• Celebrating Loday's associahedron
• Geometric realizations of the accordion complex of a dissection
• Toric Fano varieties associated to graph cubeahedra

This page was built for publication: Compatibility fans for graphical nested complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397100)