Related papers: Combinatorics of the Lipschitz polytope
Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…
We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…
We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh…
Five different ways of combinatorial description of non-empty faces of the cone of supermodular functions on the power set of a finite basic set $N$ are introduced. Their identification with faces of the cone of supermodular games allows…
The well-known Lvov-Kaplansky conjecture states that the image of a multilinear polynomial $f$ evaluated on $n\times n$ matrices is a vector space. A weaker version of this conjecture, known as the Mesyan conjecture, states that if $m=deg(…
Voronoi conjectured that any parallelotope is affinely equivalent to a Voronoi polytope. A parallelotope is defined by a set of $m$ facet vectors $p_i$ and defines a set of $m$ lattice vectors $t_i$, $1\le i\le m$. We show that Voronoi's…
We give an explicit description of the Mirkovic-Vilonen cycles on the affine Grassmannian for arbitrary complex reductive groups. We also give a combinatorial characterization of the MV polytopes. We prove that a polytope is an MV polytope…
We investigate the (ambient) bi-Lipschitz V-equivalence of two-variable mixed polynomials satisfying the Newton inner non-degeneracy condition. Concerning triviality, we show that ambient bi-Lipschitz V-triviality for families $\{f +…
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…
For a polytope we define the {\em flag polynomial}, a polynomial in commuting variables related to the well-known flag vector and describe how to express the the flag polynomial of the Minkowski sum of $k$ standard simplices in a direct and…
Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…
Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…
Rank-one symmetric spaces carry a solvable group model which have a generalization to a larger class of Lie groups that are one-dimensional extensions of nilpotent groups. By examining some metric properties of these symmetric spaces, we…
The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…
Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…
Pairs of metrics in a three-dimensional linear vector space are considered, one of which is a Minkowski type metric with the signature (+,-,-). Such metric pairs are classified and canonical presentations for them in each class are…