English
Related papers

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

200 papers

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

Combinatorics · Mathematics 2023-08-31 Christopher de Vries , Masahiko Yoshinaga

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

Combinatorics · Mathematics 2020-09-30 María Jesús de la Puente , Pedro Luis Clavería

Let $\mathcal{M}\subset \mathbb{R}^n$ be a compact and sufficiently smooth manifold of dimension $d$. Suppose $\mathcal{M}$ is nowhere completely flat. Let $N_{\mathcal{M}}(\delta,Q)$ denote the number of rational vectors $\mathbf{a}/q$…

Number Theory · Mathematics 2024-07-29 Damaris Schindler , Rajula Srivastava , Niclas Technau

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…

Classical Analysis and ODEs · Mathematics 2019-11-05 Nir Lev , Bochen Liu

The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $\alpha$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq…

Combinatorics · Mathematics 2012-11-16 Akihiro Higashitani

An algebraic classification is given for spaces of holomorphic vector-valued modular forms of arbitrary real weight and multiplier system, associated to irreducible, T-unitarizable representations of the full modular group, of dimension…

Number Theory · Mathematics 2012-01-27 Christopher Marks

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

Given $n$ symmetric Bernoulli variables, what can be said about their correlation matrix viewed as a vector? We show that the set of those vectors $R(\mathcal{B}_n)$ is a polytope and identify its vertices. Those extreme points correspond…

Probability · Mathematics 2017-07-04 Mark Huber , Nevena Maric

The random beta polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1-\|x\|^2)^\beta$ on the $d$-dimensional unit ball, where $\beta>-1$ is a parameter. Similarly, the random beta'…

Probability · Mathematics 2021-07-15 Zakhar Kabluchko

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…

Combinatorics · Mathematics 2018-07-20 Benjamin Braun , Fu Liu

The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(d,n)$ of order $n$ is studied. By computational experiments and a known result for $d=2$, we conjecture that the real part of every roots of the Ehrhart polynomial of $\Delta(d,n)$…

Combinatorics · Mathematics 2014-10-20 Hidefumi Ohsugi , Kazuki Shibata

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

Combinatorics · Mathematics 2018-06-20 Pedro Díaz Navarro

A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…

Number Theory · Mathematics 2007-05-23 Robert Erdahl , Andrei Ordine , Konstantin Rybnikov

A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…

Combinatorics · Mathematics 2014-12-19 Kalle Karu

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

We study random polytopes of the form $[X_1,\ldots,X_n]$ defined as convex hulls of independent and identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^d$ with one of the following densities: $$ f_{d,\beta} (x) =…

Probability · Mathematics 2020-02-04 Zakhar Kabluchko , Christoph Thaele , Dmitry Zaporozhets

A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…

Number Theory · Mathematics 2007-05-23 Robert Erdahl , Andrei Ordine , Konstantin Rybnikov

Let \Delta be the Okounkov body of a divisor D on a projective variety X. We describe a geometric criterion for \Delta to be a lattice polytope, and show that in this situation X admits a flat degeneration to the corresponding toric…

Algebraic Geometry · Mathematics 2014-02-18 Dave Anderson

An n-dimensional simplex \Delta in \R^n is called empty lattice simplex if \Delta \cap\Z^n is exactly the set of vertices of \Delta . A theorem of G. K. White shows that if n=3 then any empty lattice simplex \Delta \subset\R^3 is isomorphic…

Combinatorics · Mathematics 2010-04-21 Victor Batyrev , Johannes Hofscheier