English
Related papers

Related papers: Polynomial convexity with degree bounds

200 papers

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Optimization and Control · Mathematics 2020-01-28 Vu Trung Hieu

In this article, we study the generalized Poincare problem from the opposite perspective, by establishing lower bounds on the degree of the vector field in terms of invariants of the variety.

Commutative Algebra · Mathematics 2024-03-18 Marc Chardin , S. Hamid Hassanzadeh , Claudia Polini , Aron Simis , Bernd Ulrich

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Classical Analysis and ODEs · Mathematics 2016-09-07 Ilia Krasikov

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

Classical Analysis and ODEs · Mathematics 2020-01-06 Patrick Kidger

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

Classical Analysis and ODEs · Mathematics 2014-08-28 A. I. Aptekarev , J. S. Geronimo

We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has…

Optimization and Control · Mathematics 2013-06-10 Amir Ali Ahmadi , Alex Olshevsky , Pablo A. Parrilo , John N. Tsitsiklis

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

Commutative Algebra · Mathematics 2021-08-05 Francesca Gandini

Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…

Probability · Mathematics 2018-04-20 Ilya Soloveychik , Vahid Tarokh

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

Complex Variables · Mathematics 2017-01-31 Vikram Sharma

We prove two results about degree of polynomial mappings of $C^2$ to $C^2$.

alg-geom · Mathematics 2008-02-03 Pavel Katsylo

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

We show that domains, that allow for convex functions with unbounded gradient at their boundary, are convex.

Classical Analysis and ODEs · Mathematics 2007-05-23 Oliver C. Schnürer

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Optimization and Control · Mathematics 2023-05-04 Daniel Dörfler

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Logic in Computer Science · Computer Science 2023-05-23 Donghyun Lim , Martin Ziegler

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

Dynamical Systems · Mathematics 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.

Functional Analysis · Mathematics 2008-07-28 Szymon Wasowicz

We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…

Algebraic Geometry · Mathematics 2019-07-02 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia