Related papers: On combinatorics of string polytopes in types $B$ …
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
Combinatorial neural codes are $0/1$ vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is to determine when a given code can be algorithmically drawn in the plane…
It will be shown that the toric ring of the chain polytope of a finite partially ordered set is an algebra with straightening laws on a finite distributive lattice. Thus in particular every chain polytope possesses a regular unimodular…
In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…
Let $C$ be an algebraic curve defined by a sufficiently generic bivariate Laurent polynomial with given Newton polygon $\Delta$. It is classical that the geometric genus of $C$ equals the number of lattice points in the interior of…
Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
Canonical forms of positive geometries play an important role in revealing hidden structures of scattering amplitudes, from amplituhedra to associahedra. In this paper, we introduce "stringy canonical forms", which provide a natural…
The main object in this paper is a certain rational convex polytope whose lattice points give a polyhedral realization of a highest weight crystal basis. This is also identical to a Newton-Okounkov body of a flag variety, and it gives a…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…
The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
On the polytope defined in Feigin, Fourier, and Littelmann (2011), associated to any rectangle highest weight, we define a structure of an type $A_n$-crystal. We show, by using the Stembridge axioms, that this crystal is isomorphic to the…
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We study sets of univariate hyperbolic polynomials that share the same first few coefficients and show that they have a natural combinatorial description akin to that of polytopes. We define a stratification of such sets in terms of root…