Related papers: Flat $\delta$-vectors and their Ehrhart polynomial…

In this paper we study the class of polytopes which can be obtained by taking the convex hull of some subset of the points $\{e_i-e_j \ \vert \ i \neq j\} \cup \{\pm e_i\}$ in $\mathbb{R}^n$, where $e_1,\dots,e_n$ is the standard basis of…

Let $P \subset \mathbb{R}^{d}$ be a closed convex cone. Assume that $P$ is pointed, i.e. the intersection $P \cap -P=\{0\}$ and $P$ is spanning, i.e. $P-P=\mathbb{R}^{d}$. Denote the interior of $P$ by $\Omega$. Let $E$ be a product system…

Let $P(x)$ be a real polynomial of degree $2g+1$, $H=y^2+P(x)$ and $\delta(h)$ be an oval contained in the level set $\{H=h\}$. We study complete Abelian integrals of the form $$I(h)=\int_{\delta(h)} \frac{(\alpha_0+\alpha_1 x+... +…

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries at each line is equal to $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$. In the present…

Let $V$ be a finite-dimensional vector space over the field with $p$ elements, where $p$ is a prime number. Given arbitrary $\alpha,\beta\in \mathrm{GL}(V)$, we consider the semidirect products $V\rtimes\langle \alpha\rangle$ and…

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)…

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…

We give an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\G$ denote a distance-regular graph with diameter $d\ge 3$. Let $E$ denote a minimal idempotent of $\G$ which is not the trivial idempotent $E_0$. Let…

Let $X$ be a finite set. A family $P$ of subsets of $X$ is called a convex geometry with ground set $X$ if (1) $\emptyset, X\in P$; (2) $A\cap B\in P$ whenever $A,B\in P$; and (3) if $A\in P$ and $A\neq X$, there is an element $\alpha\in…

For a bounded metric space $ X $ one can consider the quantity $ \delta(X) := \text{inf\rule[-0.5ex]{0em}{1ex}}_{\,p\in X}\; \text{sup}_{q \in X} \; d(p,q) $. This purely metric invariant is known from approximation theory as the relative…

Let $A$ be a finite dimensional associative $\mathbb{K}$-algebra over an algebraically closed field $\mathbb{K}$ of characteristic zero. To $A$, we can associate its basic form that is given by a quiver $Q = (Q_0, Q_1)$ with an admissible…

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =\Delta \neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm…

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…