English
Related papers

Related papers: Optimal polynomial approximants and orthogonal pol…

200 papers

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

Let $f = P[F]$ denote the Poisson integral of $F$ in the unit disk $\mathbb{D}$ with $F$ is an absolute continuous in the unit circle $\mathbb{T}$ and $\dot{F}\in L^p(\mathbb{T})$, where $\dot{F}(e^{it}) = \frac{d}{dt} F(e^{it})$ and $p \in…

Complex Variables · Mathematics 2023-02-21 Adel Khalfallah , Miodrag Mateljević

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

Number Theory · Mathematics 2007-05-23 Simon Kristensen , Rebecca Thorn , Sanju Velani

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 construct a one-particle TOA operator $\mathcal{\hat{T}}$ canonically conjugate with the Hamiltonian describing a free, charged, spin-$0$, relativistic particle in one spatial dimension and show that it is maximally symmetric. We solve…

Quantum Physics · Physics 2015-09-02 Joseph Bunao , Eric Galapon

We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental properties of this class are first…

Optimization and Control · Mathematics 2026-04-30 Masoud Ahookhosh , Jose M. M. de Brito , Alireza Kabgani , Felipe Lara , Jinyun Yuan

The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…

Classical Analysis and ODEs · Mathematics 2007-05-23 P. J. Forrester , N. S. Witte

In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…

Combinatorics · Mathematics 2026-02-02 Ferenc Bencs , Chiara Piombi , Guus Regts

We define the notion of a thick open set $\Omega$ in a Euclidean space and show that a local Hardy-Littlewood inequality holds in $L^p(\Omega)$, $p \in (1, \infty]$. We then establish pointwise and $L^p(\Omega)$ convergence for families of…

Classical Analysis and ODEs · Mathematics 2024-03-04 Dimitrios Giannakis , Mohammad Javad Latifi Jebelli

We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…

Probability · Mathematics 2024-12-17 T. Bloom , D. Dauvergne , N. Levenberg

We investigate approximation guarantees provided by logistic regression for the fundamental problem of agnostic learning of homogeneous halfspaces. Previously, for a certain broad class of "well-behaved" distributions on the examples,…

Machine Learning · Computer Science 2022-02-01 Ziwei Ji , Kwangjun Ahn , Pranjal Awasthi , Satyen Kale , Stefani Karp

The theory of orthogonal polynomials on the unit circle (OPUC) dates back to Szeg\"o's work of 1915-21, and has been given a great impetus by the recent work of Simon, in particular his two-volume book [Si4], [Si5], the survey paper (or…

Probability · Mathematics 2012-03-06 N. H. Bingham

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

Algebraic Geometry · Mathematics 2026-03-16 Sandra Di Rocco , Kemal Rose , Luca Sodomaco

An operator theoretic approach to orthogonal rational functions on the unit circle with poles in its exterior is presented in this paper. This approach is based on the identification of a suitable matrix representation of the multiplication…

Classical Analysis and ODEs · Mathematics 2007-05-23 Luis Velazquez

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

Classical Analysis and ODEs · Mathematics 2015-07-03 Catherine Bénéteau , Alberto Condori , Constanze Liaw , Daniel Seco , Alan Sola

The energetics and stability of dislocations, vacancies and, interstitials in the one-component plasma (OCP), where the charges interact with a log potential and move on the curved surface of a cylinder have been investigated numerically.…

Statistical Mechanics · Physics 2026-01-06 G. Vilella Nilsson , M. A. Moore

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

Computational Complexity · Computer Science 2016-09-08 Alexander A. Sherstov

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

Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…

Optimization and Control · Mathematics 2023-07-18 Wei Liu , Qihang Lin , Yangyang Xu

Let $p$ be an idempotent ultrafilter over $\mathbb{N}$. For a positive integer $N$, let ${\cal P}_{\leq N}$ denote the additive group of polynomials $P\in\mathbb{Z}[x]$ with ${\rm deg}\, P\leq N$ and $P(0)=0$. Given a unitary operator $U$…

Dynamical Systems · Mathematics 2014-01-31 Vitaly Bergelson , Stanisław Kasjan , Mariusz Lemańczyk