Related papers: Sign conditions for the existence of at least one …

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…

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

We study the identification of direct and indirect causes on time series and provide conditions in the presence of latent variables, which we prove to be necessary and sufficient under some graph constraints. Our theoretical results and…

We give a necessary and sufficient condition for a system of linear inhomogeneous fractional differential equations to have at least one bounded solution. We also obtain an explicit description for the set of all bounded (or decay)…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

Consider a generic $r$-dimensional subspace of $\mathbb{R}^d$, $r<d$, and suppose that we are only given projections of this subspace onto small subsets of the canonical coordinates. The paper establishes necessary and sufficient…

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…

The exponential sum (ES) is a linear combination of characters of an additive group $\mathbb C^n$. The exponential analytic set (EAS) is a set of common zeroes of a finite tuple of ESs. We consider ES and EAS as an analogs of Laurent…

Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…

The {\em sign pattern} defined by the real polynomial $Q:=\Sigma _{j=0}^da_jx^j$, $a_j\neq 0$, is the string $\sigma (Q):=({\rm sgn(}a_d{\rm )},\ldots ,{\rm sgn(}a_0{\rm )})$. The quantities $pos$ and $neg$ of positive and negative roots of…

We consider degree-d forms on the Euclidean unit sphere. We specialize to our setting a genericity result by Nie obtained in a more general framework. We exhibit an homogeneous polynomial Res in the coefficients of f , such that if Res(f) =…

We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…

Conditional Sums-of-AM/GM-Exponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset $X$ of real space. In this article, we undertake the first structural analysis of…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…