English
Related papers

Related papers: Trigonometric polynomials deviating the least from…

200 papers

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

It has been shown in a recent work by Yakir-Zeitouni that the minimum modulus of random trigonometric polynomials with Gaussian coefficients has a limiting exponential distribution. We show this is a universal phenomenon. Our approach…

Probability · Mathematics 2021-10-06 Nicholas A. Cook , Hoi H. Nguyen

Extraction of harmonics of a given order from real trigonometric polynomials (signals) is one of the main problems in harmonic analysis. It has many applications in physics, radio and electrical engineering, in particular, in filtration of…

Classical Analysis and ODEs · Mathematics 2016-06-29 V. I. Danchenko , D. G. Vasilchenkova

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

Combinatorics · Mathematics 2017-04-18 Aleksandar Nikolov

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

Combinatorics · Mathematics 2025-02-06 Ryuhei Mizutani

We propose an algebraic approach to proving circuit lower bounds for ACC0 by defining and studying the notion of torus polynomials. We show how currently known polynomial-based approximation results for AC0 and ACC0 can be reformulated in…

Computational Complexity · Computer Science 2019-03-04 Abhishek Bhrushundi , Kaave Hosseini , Shachar Lovett , Sankeerth Rao

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis

In the first part we study deviation of a polynomial from its mathematical expectation. This deviation can be estimated from above by Carbery--Wright inequality, so we investigate estimates of the deviation from below. We obtain such…

Probability · Mathematics 2016-03-18 Lavrentin M. Arutyunyan , Egor D. Kosov

We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…

Numerical Analysis · Mathematics 2024-11-19 Nikolai Krivulin

The orthogonal polynomials $p_n$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give general criteria for orthogonal polynomials to satisfy Tur\'an's…

Classical Analysis and ODEs · Mathematics 2007-10-19 Ryszard Szwarc

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

Classical Analysis and ODEs · Mathematics 2009-10-23 F. Balogh , M. Bertola

Given a sequence of polynomials $Q_n$ of degree $n$ with zeros on $[-1,1]$, we consider the triangular table of derivatives $Q_{n, k}(x)=d^k Q_n(x) /d x^k$. Under the assumption that the sequence $\{Q_n\}$ has a weak* limiting zero…

Classical Analysis and ODEs · Mathematics 2025-01-31 Andrei Martinez-Finkelshtein , Evgenii A. Rakhmanov

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Classical Analysis and ODEs · Mathematics 2019-09-24 Tamás Erdélyi

We consider random trigonometric polynomials of the form \[ f_n(t):=\frac{1}{\sqrt{n}} \sum_{k=1}^{n}a_k \cos(k t)+b_k \sin(k t), \] where $(a_k)_{k\geq 1}$ and $(b_k)_{k\geq 1}$ are two independent stationary Gaussian processes with the…

Probability · Mathematics 2020-02-05 Thibault Pautrel

The random trigonometric series $\sum_{n=1}^\infty \rho_n \cos (nt +\omega_n)$ on the circle $\mathbb{T}$ are studied under the conditions $\sum |\rho_n|^2=\infty$ and $\rho_n\to 0$, where $\{\omega_n\}$ are iid and uniformly distributed on…

Probability · Mathematics 2022-05-20 Aihua Fan , Yve Meyer

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

Data Structures and Algorithms · Computer Science 2023-06-22 Katrin Casel , Philipp Fischbeck , Tobias Friedrich , Andreas Göbel , J. A. Gregor Lagodzinski

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

Classical Analysis and ODEs · Mathematics 2025-01-09 Benjamin Bedert

Let $K$ be a non-polar compact subset of $\mathbb{R}$ and $\mu_K$ denote the equilibrium measure of $K$. Furthermore, let $P_n\left(\cdot, \mu_K\right)$ be the $n$-th monic orthogonal polynomial for $\mu_K$. It is shown that…

Classical Analysis and ODEs · Mathematics 2016-03-25 Gökalp Alpan

In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

Commutative Algebra · Mathematics 2011-10-05 Enrico Carlini , Maria Virginia Catalisano , Anthony V. Geramita

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

Complex Variables · Mathematics 2016-10-11 Andrew Thomack