English
Related papers

Related papers: Sampling of real multivariate polynomials and plur…

200 papers

Given multiple orthogonal polynomials on the real line with respect to a system $\bm{\mu} = (\mu_1,\ldots,\mu_r)$, we investigate multiple orthogonal polynomials associated with any rational perturbation of the form $$…

Classical Analysis and ODEs · Mathematics 2026-03-24 Rostyslav Kozhan , Marcus Vaktnäs

For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…

Statistics Theory · Mathematics 2008-10-10 T. Royen

We provide a partially affirmative answer to the following question on robustness of polynomial stability with respect to sampling: ``Suppose that a continuous-time state-feedback controller achieves the polynomial stability of the…

Optimization and Control · Mathematics 2023-07-31 Masashi Wakaiki

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

Commutative Algebra · Mathematics 2026-05-19 Olav Geil

By the celebrated Weierstrass Theorem the set of algebraic polynomials is dense in the space of continuous functions on a compact set in R^d. In this paper we study the following question: does the density hold if we approximate only by…

Classical Analysis and ODEs · Mathematics 2007-05-23 David Benko , Andras Kroo

We show that the Newton polytope of a polynomial has a strong impact on the distribution of its mass and zeros. The basic theme is that Newton polytopes determine allowed and forbidden regions for these distributions. We equip the space of…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…

Numerical Analysis · Mathematics 2018-05-09 S. Chandrasekaran , C. H. Gorman , H. N. Mhaskar

We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the…

Number Theory · Mathematics 2014-02-04 Manjul Bhargava

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to…

Information Theory · Computer Science 2012-01-18 J. D. McEwen , Y. Wiaux

We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…

Probability · Mathematics 2023-01-02 Yen Do , Doron Lubinsky , Hoi H. Nguyen , Oanh Nguyen , Igor Pritsker

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

Computational Complexity · Computer Science 2022-07-21 Hunter Monroe

We obtain the strong asymptotics of polynomials $p_n(\lambda)$, $\lambda\in\mathbb{C}$, orthogonal with respect to measures in the complex plane of the form $$ e^{-N(|\lambda|^{2s}-t\lambda^s-\overline{t\lambda}^s)}dA(\lambda), $$ where $s$…

Mathematical Physics · Physics 2016-07-05 Ferenc Balogh , Tamara Grava , Dario Merzi

We show that under very mild conditions on a measure $\mu$ on the interval $[0,\infty)$, the span of $\{x^k\}_{k=n}^{\infty}$ is dense in $L^2(\mu)$ for any $n=0,1,\ldots$. We present two different proofs of this result, one based on the…

Classical Analysis and ODEs · Mathematics 2025-02-19 Christian Berg , Brian Simanek , Richard Wellman

In this paper, we address the problem of approximating a multivariate function defined on a general domain in $d$ dimensions from sample points. We consider weighted least-squares approximation in an arbitrary finite-dimensional space $P$…

Numerical Analysis · Mathematics 2019-12-17 Ben Adcock , Juan M. Cardenas

We prove a new generalization bound that shows for any class of linear predictors in Gaussian space, the Rademacher complexity of the class and the training error under any continuous loss $\ell$ can control the test error under all Moreau…

Machine Learning · Statistics 2022-10-24 Lijia Zhou , Frederic Koehler , Pragya Sur , Danica J. Sutherland , Nathan Srebro

A classical theorem of Szeg\H{o} states that for any probability measure $\mu=w\frac{\mathrm{d}\theta}{2\pi}+\mu_s$ on the unit circle the polynomials are dense in $L^2(\mathbb{T},\mu)$ if and only if $\log(w)\notin L^1(\mathbb{T})$. A…

Classical Analysis and ODEs · Mathematics 2025-11-13 Chiara Paulsen

In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…

Mathematical Physics · Physics 2020-06-16 Mohammad Masjed-Jamei , Zahra Moalemi , Nasser Saad

We show how localization and smoothing techniques can be used to establish universality in the bulk of the spectrum for a fixed positive measure mu on [-1,1]. Assume that mu is a regular measure, and is absolutely continuous in an open…

Classical Analysis and ODEs · Mathematics 2007-05-23 Doron S Lubinsky

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Numerical Analysis · Mathematics 2018-10-30 Sharif Rahman

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Cryptography and Security · Computer Science 2022-09-22 Alessio Caminata , Elisa Gorla