Related papers: On the gaps between zeros of trigonometric polynom…

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…

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 analyze a class of piecewise linear parabolic maps on the torus, namely those obtained by considering a linear map with double eigenvalue one and taking modulo one in each component. We show that within this two parameter family of maps,…

Our goal in this paper is to study the zero distribution of a sequence of polynomials whose coefficients satisfy a three-term recurrence. Equivalently, these polynomials are Taylor polynomials of a rational function with a polynomial…

The \emph{Wiener polynomial} of a connected graph $G$ is the polynomial $W(G;x) = \sum_{i=1}^{D(G)} d_i(G)x^i$ where $D(G)$ is the diameter of $G$, and $d_i(G)$ is the number of pairs of vertices at distance $i$ from each other. We examine…

We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…

This is a survey on the Darboux theory of integrability for polynomial vector fields, first in $\R^n$ and second in the $n$-dimensional sphere $\sss^n$. We also provide new results about the maximum number of parallels and meridians that a…

In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.

Sard's theorem asserts that the set of critical values of a smooth map from one Euclidean space to another one has measure zero. A version of this result for infinite-dimensional Banach manifolds was proven by Smale for maps with Fredholm…

We prove a detailed sums of squares formula for two variable polynomials with no zeros on the bidisk $\mathbb{D}^2$ extending previous versions of such a formula due to Cole-Wermer and Geronimo-Woerdeman. The formula is related to the…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

In gauge theories on a spacetime equipped with a circle, the holonomy variables, living in the Cartan torus, play special roles. With their periodic nature properly taken into account, we find that a supersymmetric gauge theory in $d$…

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…

The equations of motion of the massless sector of the two dimensional string theory, obtained by compactifying the heterotic string theory on an eight dimensional torus, is known to have an affine o(8,24) symmetry algebra generating an…

The expected number of zeros of a random real polynomial of degree $N$ asymptotically equals $\frac{2}{\pi}\log N$. On the other hand, the average fraction of real zeros of a random trigonometric polynomial of increasing degree $N$…

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

A dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. The domination polynomial is defined by $D(G,x) = \sum d_k x^k$ where $d_k$ is the…

We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…