Related papers: Pruned inside-out polytopes, combinatorial recipro…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
In this note, we apply combinatorial techniques from our Ph.D. thesis to study how generalized permutohedra may be represented functionally on Parke-Tayor factors and related rational functions. In any functional representation of…
Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…
We derive a formula for the number of lattice points in type B generalized permutohedra, providing a concise alternative to the formula obtained recently by Eur, Fink, Larson, and Spink as a result from a study of delta-matroids. Our…
Let $p_1,p_2,\dots,p_n, a_1,a_2,\dots,a_n \in \N$, $x_1,x_2,\dots,x_n \in \R$, and denote the $k$th periodized Bernoulli polynomial by $\B_k(x)$. We study expressions of the form \[ \sum_{h \bmod{a_k}} \ \prod_{\substack{i=1\\ i\not=k}}^{n}…
Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…
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 foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…
Transfer-Matrix Methods originated in physics where they were used to count the number of allowed particle states on a structure whose width $n$ is a parameter. Typically, the number of states is exponential in $n.$ One more mathematical…
The aim of this work is to offer a general theory of reciprocity laws for symbols on arbitrary vector spaces, and to show that classical explicit reciprocity laws are particular cases of this theory (sum of valuations on a complete curve,…
The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…
In this paper, we announce results from our thesis, which studies for the first time the categorification of the theory of generalized permutohedra. The vector spaces in the categorification are tightly constrained by certain continuity…
We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end points. Like in the case of deletion and contraction only (W.…
For a poset P, a subposet A, and an order preserving map F from A into the real numbers, the marked order polytope parametrizes the order preserving extensions of F to P. We show that the function counting integral-valued extensions is a…
In 2017 Aguiar and Ardila provided a generic way to construct polynomial invariants of combinatorial objects using the notions of Hopf monoids and characters of Hopf monoids. They show that it is possible to find a combinatorial…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…