Related papers: The depth of a reflexive polytope

We investigate polytopes inscribed into a sphere that are normally equivalent (or strongly isomorphic) to a given polytope $P$. We show that the associated space of polytopes, called the inscribed cone of $P$, is closed under Minkowski…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…

We study the rational Cherednik algebra attached to the complex reflection group $G(r,1,2)$. Each irreducible representation $S^\lambda$ of $G(r,1,2)$ corresponds to a standard module $\Delta(\lambda)$ for the rational Cherednik algebra. We…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

We compute, for a compact set $K\subset\mathbb R^d$, the value of the upper and of the lower $L^q$-dimension of a typical probability measure with support contained in $K$, for any $q\in\mathbb R$. Different definitions of the "dimension"…

Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Let $\cal P$ be a finite classical polar space of rank $d$. An $m$-regular system with respect to $(k - 1)$-dimensional projective spaces of $\cal P$, $1 \le k \le d - 1$, is a set $\cal R$ of generators of $\cal P$ with the property that…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

The diameter of the graph of a $d$-dimensional lattice polytope $P \subseteq [0,k]^{n}$ is known to be at most $dk$ due to work by Kleinschmidt and Onn. However, it is an open question whether the monotone diameter, the shortest guaranteed…

Let $X_P$ be a smooth projective toric variety of dimension $n$ embedded in $\PP^r$ using all of the lattice points of the polytope $P$. We compute the dimension and degree of the secant variety $\Sec X_P$. We also give explicit formulas in…

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Let $d$ and $n$ be positive integers with $n \geq d + 1$ and $\tau_{1}, ..., \tau_{n}$ integers with $\tau_{1} < ... < \tau_{n}$. Let $C_{d}(\tau_{1}, ..., \tau_{n}) \subset \RR^{d}$ denote the cyclic polytope of dimension $d$ with $n$…

We present a method of constructing discrete integrable systems with crystallographic reflection group (Weyl) symmetries, thus clarifying the relationship between different discrete integrable systems in terms of their symmetry groups.…