English
Related papers

Related papers: Convexifying positive polynomials and sums of squa…

200 papers

We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…

Optimization and Control · Mathematics 2021-03-23 Chenyang Yuan , Pablo A. Parrilo

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

Optimization and Control · Mathematics 2015-03-24 Mehdi Ghasemi , Murray Marshall

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…

Optimization and Control · Mathematics 2015-09-15 Fabrizio Dabbene , Didier Henrion , Constantino Lagoa

Suppose $f,g$ are homogeneous polynomials of degree $d$ defining smooth hypersurfaces $X_f = V(f)\subset \mathbb{P}^{m-1}$ and $X_g = V(g)\subset\mathbb{P}^{n-1}$. Then the sum $f(x)+g(y)$ defines a smooth hypersurface…

Algebraic Geometry · Mathematics 2020-10-05 Bronson Lim

The expansion of bivariate polynomials is well-understood for sets with a linear-sized product set. In contrast, not much is known for sets with small sumset. In this work, we provide expansion bounds for polynomials of the form $f(x, y) =…

Combinatorics · Mathematics 2024-10-29 Sanjana Das , Cosmin Pohoata , Adam Sheffer

In 1995, Reznick showed an important variant of the obvious fact that any positive semidefinite (real) quadratic form is a sum of squares of linear forms: If a form (of arbitrary even degree) is positive definite then it becomes a sum of…

Algebraic Geometry · Mathematics 2023-10-20 Markus Schweighofer , Luis Felipe Vargas

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Complex Variables · Mathematics 2025-06-26 Stéphane Charpentier , Konstantinos Maronikolakis

Energy functions offer natural extensions of controllability and observability Gramians to nonlinear systems, enabling various applications such as computing reachable sets, optimizing actuator and sensor placement, performing balanced…

Optimization and Control · Mathematics 2024-08-23 Hamza Adjerid , Jeff Borggaard

Let $K$ be a totally real number field with Galois closure $L$. We prove that if $f \in \mathbb Q[x_1,...,x_n]$ is a sum of $m$ squares in $K[x_1,...,x_n]$, then $f$ is a sum of \[4m \cdot 2^{[L: \mathbb Q]+1} {[L: \mathbb Q] +1 \choose…

Commutative Algebra · Mathematics 2008-08-29 Christopher J. Hillar

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

Let $C$ be a compact convex subset of $\mathbb{R}^n$, $f:C\to\mathbb{R}$ be a convex function, and $m\in\{1, 2, ..., \infty\}$. Assume that, along with $f$, we are given a family of polynomials satisfying Whitney's extension condition for…

Classical Analysis and ODEs · Mathematics 2019-03-05 Daniel Azagra , Carlos Mudarra

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Number Theory · Mathematics 2020-01-29 Jean-Louis Verger-Gaugry , Jaroslav Hancl , Radhakrishnan Nair

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

Dynamical Systems · Mathematics 2025-08-05 Stefan Steinerberger

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

Complex Variables · Mathematics 2023-07-19 Sorin G. Gal , Irene Sabadini

We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…

Optimization and Control · Mathematics 2007-05-23 Alexander Barvinok

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Complex Variables · Mathematics 2015-08-28 Gautam Bharali

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…

Functional Analysis · Mathematics 2015-11-02 Nathan S. Feldman , Paul J. McGuire
‹ Prev 1 8 9 10 Next ›