Related papers: Acyclotopes and Tocyclotopes
Employing two models, we show that various counting functions of a random variable defined by restriction or contraction of a ranked set with multiplicity (e.g., classical and arithmetic matroids) have expectations given by the…
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…
In this article, we give two extended space formulations, respectively, for the induced tree and path polytopes of chordal graphs with vertex and edge variables. These formulations are obtained by proving that the induced tree and path…
The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute…
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
It is a classical fact that the number of vertices of the graphical zonotope $Z_\Gamma$ is equal to the number of acyclic orientations of a graph $\Gamma$. We show that the $f$-polynomial of $Z_\Gamma$ is obtained as the principal…
There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to…
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…
We introduce a new cohomology theory for stacks called elliptic Hochschild homology, prove some fundamental properties and compute it in some classes of examples. We then introduce its periodic cyclic version and show that, over the complex…
We give two new constructions of the harmonic algebra of a lattice polytope $P$, a bigraded algebra whose character is the $q$-Ehrhart series of $P$ defined by Reiner and Rhoades. First, we show that the harmonic algebra is the associated…
We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Zonotopal algebras (external, central, and internal) of an undirected graph G introduced by Postnikov-Shapiro and Holtz-Ron, are finite-dimensional commutative graded algebras whose Hilbert series contain a wealth of combinatorial…