Related papers: Explicit Construction of Polytopes whose Ehrhart P…

We give sign conditions on the support and coefficients of a sparse system of d generalized polynomials in d variables that guarantee the existence of at least one positive real root, based on degree theory and Gale duality. In the case of…

In this paper we consider polytopes given by systems of $n$ inequalities in $d$ variables, where every inequality has at most two variables with nonzero coefficient. We denote this family by $LI(2)$. We show that despite of the easy…

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…

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

The magic positivity of Ehrhart polynomials is a useful tool for proving the real-rootedness of the $h^\ast$-polynomials. In this paper, we provide a new class of reflexive polytopes whose Ehrhart polynomials are magic positive. First, we…

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

We study real univariate polynomials with non-zero coefficients and with all roots real, out of which exactly two positive. The sequence of coefficients of such a polynomial begins with $m$ positive coefficients followed by $n$ negative…

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…

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

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

In 1888 Hilbert showed that every nonnegative homogeneous polynomial with real coefficients of degree $2d$ in $n$ variables is a sum of squares if and only if $d=1$ (quadratic forms), $n=2$ (binary forms) or $(n,d)=(3,2)$ (ternary…

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…

We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…

The refined inertia of a square real matrix $A$ is the ordered $4$-tuple $(n_+, n_-, n_z, 2n_p)$, where $n_+$ (resp., $n_-$) is the number of eigenvalues of $A$ with positive (resp., negative) real part, $n_z$ is the number of zero…

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

For each $d\geq 3$, $n \geq 10$, and $k_1, k_2, \ldots, k_{d-1}\geq 2$ with $k_1+k_2+\ldots+k_{d-1}\leq n-1$, we construct a regular $d$-polytope whose automorphism group is of order $2^n$ and whose Schl\"afli type is $\{2^{k_1},2^{k_2},…