English
Related papers

Related papers: Van der Waerden/Schrijver-Valiant like Conjectures…

200 papers

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $I$ be a homogeneous ideal of $A$ with $I \ne A$ and $H_{A/I}$ the Hilbert function of the quotient algebra $A / I$. Given…

Commutative Algebra · Mathematics 2008-12-01 Satoshi Murai , Takayuki Hibi

For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.

Optimization and Control · Mathematics 2012-03-24 Long Wang

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

Combinatorics · Mathematics 2007-05-23 Rudi Hirschfeld

We prove that, for $C^1$-generic diffeomorphisms, if the periodic orbits contained in a homoclinic class $H(p)$ have all their Lyapunov exponents bounded away from 0, then $H(p)$ must be (uniformly) hyperbolic. This is in sprit of the works…

Dynamical Systems · Mathematics 2017-09-27 Xiaodong Wang

The Sidon constant for the index set of nonzero m-homogeneous polynomials P in n complex variables is the supremum of the ratio between the l^1 norm of the coefficients of P and the supremum norm of P in D^n. We present an estimate which…

Complex Variables · Mathematics 2009-03-10 Joaquim Ortega-Cerdà , Myriam Ounaïes , Kristian Seip

For a NIP theory $T$, a sufficiently saturated model $\mathfrak{C}$ of $T$, and an invariant (over some small subset of $\mathfrak{C}$) global type $p$, we prove that there exists a finest relatively type-definable over a small set of…

Logic · Mathematics 2025-07-16 Krzysztof Krupiński , Adrián Portillo

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok

Let $f\in\mathbb{Z}[T]$ be any polynomial of degree $d>1$ and $F\in\mathbb{Z}[X_{0},...,X_{n}]$ an irreducible homogeneous polynomial of degree $e>1$ such that the projective hypersurface $V(F)$ is smooth. In this paper we give a bound for…

Number Theory · Mathematics 2019-06-10 Dante Bonolis

We consider the stability of high-order Scott-Vogelius elements for 2D non-Newtonian incompressible flow problems. For elements of degree 4 or higher, we construct a right-inverse of the divergence operator that is stable uniformly in the…

Numerical Analysis · Mathematics 2025-09-25 Charles Parker , Endre Süli

The paper studies the minimum polynomial degrees of $p$-elements in cross-characteristic representations of simple groups of exceptional Lie type whose BN-pair rank is at most 2. Specifically, we prove that the degree in question equals the…

Representation Theory · Mathematics 2021-06-08 Pham Huu Tiep , A. E. Zalesski

Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…

Commutative Algebra · Mathematics 2007-05-23 Emanoil Theodorescu

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

Given a real polynomial $p$ with only real zeroes, we find upper and lower bounds for the number of non-real zeroes of the differential polynomial $$ F_{\varkappa}[p](z):= p(z)p''(z)-\varkappa[p'(z)]^2,$$ where $\varkappa$ is a real number.…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov , Mohamed J. Atia

We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…

Probability · Mathematics 2025-12-16 Silouanos Brazitikos , Christos Pandis

The growth of Hilbert coefficients for powers of ideals are studied. For a graded ideal $I$ in the polynomial ring $S=K[x_1,...,x_n]$ and a finitely generated graded $S$-module, the Hilbert coefficients $e_i(M/I^kM)$ are polynomial…

Commutative Algebra · Mathematics 2009-11-13 Juergen Herzog , Tony J. Puthenpurakal , J. K. Verma

We call a smooth function of one variable a degree n pseudopolynomial if its n-th derivative has no (real) zeros. An n pseudopolynomial is called hyperbolic if it has exactly n simple zeros. In this short note we describe the necessary and…

Classical Analysis and ODEs · Mathematics 2007-05-23 B. Shapiro , M. Shapiro

In the recent progress [BE1], [Me] and [Z2], the well-known JC (Jacobian conjecture) ([BCW], [E]) has been reduced to a VC (vanishing conjecture) on the Laplace operators and HN (Hessian nilpotent) polynomials (the polynomials whose Hessian…

Complex Variables · Mathematics 2009-02-02 Wenhua Zhao

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…

Computer Vision and Pattern Recognition · Computer Science 2015-05-05 Alexander Shekhovtsov