Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInteger decomposition property of polytopes
86
0
0.0
(
0
)
Authors
Sharon Robins
Ask ChatGPT about the research
No Arabic abstract
We study the integer decomposition property of lattice polytopes associated with the $n$-dimensional smooth complete fans with at most $n+3$ rays. Using the classification of smooth complete fans by Kleinschmidt and Batyrev and a reduction to lower dimensional polytopes we prove the integer decomposition property for lattice polytopes in this setting.
rate research
Read More
Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained realization spaces of polytopes.
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{k,n}$. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of $M$. Our proofs are based on a natural extension of Postnikovs theory of generalized permutohedra.
We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C) on W with constant rational coefficients, which is unchanged when C is translated by an integral vector. Then for every convex rational polytope P in a rational euclidean space V and every polynomial function f (x) on V, the sum of the values of f(x) at the integral points of P is equal to the sum, for all faces F of P, of the integral over F of the function D(N(F)).f, where we denote by N(F) the normal cone to P along F.
It is known that the coordinate ring of the Grassmannian has a cluster structure, which is induced from the combinatorial structure of a plabic graph. A plabic graph is a certain bipartite graph described on the disk, and there is a family of plabic graphs giving a cluster structure of the same Grassmannian. Such plabic graphs are related by the operation called square move which can be considered as the mutation in cluster theory. By using a plabic graph, we also obtain the Newton-Okounkov polytope which gives a toric degeneration of the Grassmannian. The purposes of this article is to survey these phenomena and observe the behavior of Newton-Okounkov polytopes under the operation called the combinatorial mutation of polytopes. In particular, we reinterpret some operations defined for Newton-Okounkov polytopes using the combinatorial mutation.
A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the general case is reduced to the binary case. A Markov basis for binary hierarchical models whose simplicial complexes is the complement of an interval is given.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
