English
Related papers

Related papers: The Minimum Period of the Ehrhart Quasi-polynomial…

200 papers

Let $P$ be a simple polytope of dimension $n$ with $m$ facets. In this paper we pay our attention on those elementary symmetric polynomials in the Stanley--Reisner face ring of $P$ and study how the decomposability of the $n$-th elementary…

Algebraic Topology · Mathematics 2016-03-01 Zhi Lü , Jun Ma , Yi Sun

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…

Combinatorics · Mathematics 2025-01-20 Yuhan Jiang

We say a polytope is Ehrhart positive if all the coefficients in its Ehrhart polynomial are positive. Answering an Ehrhart positivity question posed on Mathoverflow, Stanley provided an example of a non-Ehrhart-positive order polytope of…

Combinatorics · Mathematics 2020-09-08 Fu Liu , Akiyoshi Tsuchiya

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Complex Variables · Mathematics 2016-12-05 D. V. Bogdanov , T. M. Sadykov

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Combinatorics · Mathematics 2018-09-27 Calvin Leng , Christopher O'Neill

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

Computational Complexity · Computer Science 2018-10-30 Manuel Bodirsky , Marcello Mamino

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Dynamical Systems · Mathematics 2010-04-14 Benjamin Hutz , Patrick Ingram

In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…

Combinatorics · Mathematics 2018-08-02 Quang-Nhat Le

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

Combinatorics · Mathematics 2017-01-03 Jesús A. De Loera , David C. Haws , Matthias Köppe

An element $a$ of a ring $R$ is called \emph{quasipolar} provided that there exists an idempotent $p\in R$ such that $p\in comm^2(a)$, $a+p\in U(R)$ and $ap\in R^{qnil}$. A ring $R$ is \emph{quasipolar} in case every element in $R$ is…

Rings and Algebras · Mathematics 2014-01-14 Orhan Gurgun , Sait Halicioglu , Abdullah Harmanci

It is well known that R^N has subspaces of dimension proportional to N on which the \ell_1 norm is equivalent to the \ell_2 norm; however, no explicit constructions are known. Extending earlier work by Artstein--Avidan and Milman, we prove…

Functional Analysis · Mathematics 2009-04-12 Shachar Lovett , Sasha Sodin

Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr [X belongs to P] - Pr [Y…

Computational Complexity · Computer Science 2013-02-05 Prahladh Harsha , Adam Klivans , Raghu Meka

When $p(t)$ is a polynomial of degree $d$, $k$-th column of the Riordan array $\bigl(1/(1 - t^{d+1}), tp(t)\bigr)$ is an eventually periodic sequence with the repeating part beginning at the $1 + (k-1)(d+1)$-st term. The pre-periodic terms…

Combinatorics · Mathematics 2024-07-30 Nikolai A. Krylov

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

Combinatorics · Mathematics 2015-03-13 Tetsushi Matsui , Akihiro Higashitani , Yuuki Nagazawa , Hidefumi Ohsugi , Takayuki Hibi

The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart…

Combinatorics · Mathematics 2012-03-07 Felix Breuer

The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional…

Combinatorics · Mathematics 2017-12-13 Tiago Royer

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…

Combinatorics · Mathematics 2016-07-26 João Gouveia , Kanstanstin Pashkovich , Richard Z. Robinson , Rekha R. Thomas

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…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin
‹ Prev 1 3 4 5 6 7 10 Next ›