Related papers: Compatibility fans for graphical nested complexes
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
Let $(W,S)$ be a finite Coxeter system acting by reflections on an $\mathbb R$-Euclidean space with simple roots $\Delta=\{\a_s | s\in S\}$ of the same length and fundamental weights $\Delta^*=\{v_s | s\in S\}$. We set $M(e)=\sum_{s\in…
The category of (abstract) fans is to the category of monoids what the category of schemes is to the category of rings: a fan is obtained by gluing spectra of monoids along open embeddings. Here we study the basic algebraic geometry of…
Associated to any divisor in the Chow ring of a simplicial tropical fan, we construct a family of polytopal complexes, called normal complexes, which we propose as an analogue of the well-studied notion of normal polytopes from the setting…
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…
Given any finite graph, we offer a simple realization of the graph-associahedron polytope using integer coordinates.
Given a simple graph $G$, the graph associahedron $P_G$ is a convex polytope whose facets correspond to the connected induced subgraphs of $G$. Graph associahedra have been studied widely and are found in a broad range of subjects.…
A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…
An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…
The tropical variety defined by linear equations with constant coefficients is the Bergman fan of the corresponding matroid. Building on a self-contained introduction to matroid polytopes, we present a geometric construction of the Bergman…
The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…
We describe the structure of simplicial locally convex fans associated to even-dimensional complete toric varieties with signature 0. They belong to the set of such toric varieties whose even degree Betti numbers yield a top gamma vector…
For any lattice congruence of the weak order on permutations, N. Reading proved that gluing together the cones of the braid fan that belong to the same congruence class defines a complete fan, called a quotient fan, and V. Pilaud and F.…
In dimension 4, we extend the correspondence between compact nonsingular toric varieties and regular fans to a correspondence between almost complex torus manifolds and families of multi-fans in a geometric way, where an (almost) complex…
In the paper: Fans in the Theory of Real Semigroups. I. Algebraic Theory (submitted) we introduced the notion of fan in the categories of real semigoups and their dual abstract real spectra and developed the algebraic theory of these…
In this paper we answer a question posed by V.V. Batyrev. The question asked if there exists a complete regular fan with more than quadratically many primitive collections. We construct a smooth projective toric variety associated to a…
In this paper we study the geometry and combinatorics of the possible rational polyhedral fans with a given set of rays. The main questions we consider are when such fans are projective, complete, or simplicial. To answer these questions we…
In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who proved that every $n$-vertex fan-planar drawing has at most…
We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the…
We establish a correspondence between simplicial fans, not necessarily rational, and certain foliated compact complex manifolds called LVMB-manifolds. In the rational case, Meersseman and Verjovsky have shown that the leaf space is the…