English
Related papers

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

200 papers

Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if…

Combinatorics · Mathematics 2018-09-05 Fu Liu

Toric topology assigns to each $n$-dimensional combinatorial simple convex polytope $P$ with $m$ facets an $(m+n)$-dimensional moment-angle manifold $\mathcal{Z}_P$ with an action of a compact torus $T^m$ such that $\mathcal{Z}_P/T^m$ is a…

Algebraic Topology · Mathematics 2020-12-29 Nikolai Erokhovets

The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…

Combinatorics · Mathematics 2020-07-15 Dylan Pentland

We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).

Combinatorics · Mathematics 2009-04-24 Takayuki Hibi , Akihiro Higashitani , Yuuki Nagazawa

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

Classical Analysis and ODEs · Mathematics 2009-10-23 F. Balogh , M. Bertola

Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for…

Data Structures and Algorithms · Computer Science 2026-02-09 Danny Hermelin , Dvir Shabtay

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

Number Theory · Mathematics 2015-05-27 Dragos Ghioca , Khoa Nguyen , Thomas J. Tucker

We extend the restricted phase space formalism for spherically symmetric black hole solutions of Einstein-Maxwell theory to the quasi-local regime, with the static observers located at a finite radial distance. The first law and Euler…

General Relativity and Quantum Cosmology · Physics 2026-05-11 Bai-Hao Huang , Liu Zhao

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

Combinatorics · Mathematics 2023-01-25 Ichiro Sainose , Ginji Hamano , Tatsuo Emura , Takayuki Hibi

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

Metric Geometry · Mathematics 2021-09-24 Csenge Lili Ködmön , Zsolt Lángi

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

Dynamical Systems · Mathematics 2007-11-21 A. Fish

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

Algebraic Geometry · Mathematics 2017-07-04 Olivier Benoist

The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…

Combinatorics · Mathematics 2025-01-09 Justus Bruckamp , Lina Goltermann , Martina Juhnke , Erik Landin , Liam Solus

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

Commutative Algebra · Mathematics 2021-09-14 Amir Jafari , Amin Najafi Amin

Consider the Wronskians of the classical Hermite polynomials $$H_{\lambda, l}(x):=\mathrm{Wr}(H_l(x),H_{k_1}(x),\ldots, H_{k_n}(x)), \quad l \in \mathbb Z_{\geq 0},$$ where $k_i=\lambda_i+n-i, \,\, i=1,\dots, n$ and $\lambda=(\lambda_1,…

Mathematical Physics · Physics 2016-04-20 William A. Haese-Hill , Martin A. Hallnäs , Alexander P. Veselov

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

Computational Complexity · Computer Science 2011-11-10 Deepak Chermakani

Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of…

Metric Geometry · Mathematics 2013-01-29 O. Aichholzer , L. E. Caraballo , J. M. Díaz-Báñez , R. Fabila-Monroy , C. Ochoa , P. Nigsch

We call the $\delta$-vector of an integral convex polytope of dimension $d$ flat if the $\delta$-vector is of the form $(1,0,\ldots,0,a,\ldots,a,0,\ldots,0)$, where $a \geq 1$. In this paper, we give the complete characterization of…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\optX}[1]{#1^\star} \newcommand{\Qopt}{\Mh{\optX{Q}}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q}…

Computational Geometry · Computer Science 2023-06-06 Sariel Har-Peled , Benjamin Raichel