相关论文: Shelling and triangulating the (extra)ordinary pol…

Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…

For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…

We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

We consider a class of exponentials in the Weyl-Heisenberg algebra with exponents of type at most linear in coordinates and arbitrary functions of momenta. They are expressed in terms of normal ordering where coordinates stand to the left…

We present a method of constructing non-normal very ample polytopes as a segmental fibration of unimodular graph polytopes. In many cases we explicitly compute their invariants - Hilbert function, Ehrhart polynomial, gap vector. In…

Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…

We address two longstanding open problems, one originating in PL topology, another in birational geometry. First, we prove the weighted version of Oda's \emph{strong factorization conjecture} (1978), and prove that every two birational…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…

An enumerative theory of triangulations of simplicial complexes has been developed by Stanley. A key role in his theory is played by the local $h$-polynomial of a triangulation of a simplex. This paper develops a parallel theory, in which…

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

The weighted triangulation algebras associated to triangulation quivers and their socle deformations were recently introduced and studied in [15]-[20] and [2]. These algebras, based on surface triangulations and originated from the theory…

We show that the "double circle" order type and some of its generalizations have a compatible triangulation with any other order types with the same number of points and number of edges on convex hull, thus proving another special case of…

Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…

The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…

The Poincar\'e polynomial of a Weyl group calculates the Betti numbers of the projective homogeneous space $G/B$, while the $h$-vector of a simple polytope calculates the Betti numbers of the corresponding rationally smooth toric variety.…

In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…

We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…