Related papers: On combinatorics of string polytopes in types $B$ …
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
We describe a class of isolated nondegenerate hypersurface singularities that give a polynomial contribution to Batyrev's stringy E-function. These singularities are obtained by imposing a natural condition on the facets of the Newton…
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary $B_2$-sequences. Binary $B_2$-sequences are collections of binary strings of length…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We classify here combinatorially rigid simple polytopes with three facets more than their dimension.
A combinatorial description of the crystal $\mathcal{B}(\infty)$ for finite-dimensional simple Lie algebras in terms of Young tableaux was developed by J. Hong and H. Lee. Using this description, we obtain a combinatorial rule for…
The main result of this note is that the toric degenerations of flag varieties associated to string polytopes and certain Bott-Samelson resolutions of flag varieties fit into a commutative diagram which gives a resolution of singularities…
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and…
Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…
We study topological and integrable aspects of $\hat{c}=1$ strings. We consider the circle line theories 0A and 0B at particular radii, and the super affine theories at their self-dual radii. We construct their ground rings, identify them…
Inspired by ideas from algebraic geometry, Batyrev and the first named author have introduced the stringy E-function of a Gorenstein polytope. We prove that this a priori rational function is actually a polynomial, which is part of a…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
This is an overview of results from our experiment of merging two seemingly unrelated disciplines - higher algebraic K-theory of rings and the theory of lattice polytopes. The usual K-theory is the ``theory of a unit simplex''. A conjecture…
We consider the possible existence of gravitationally bound stringlike objects in the framework of the generalized hybrid metric-Palatini gravity theory, in which the gravitational action is represented by an arbitrary function of the Ricci…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…