English
Related papers

Related papers: On the Widom factors for $L_p$ extremal polynomial…

200 papers

We prove in a direct fashion that a multidimensional probability measure is determinate if the higher dimensional analogue of Carleman's condition is satisfied. In that case, the polynomials, as well as certain proper subspaces of the…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

The generalized Stieltjes--Wigert polynomials depending on parameters 0\le p<1 and 0<q<1 are discussed. By removing the mass at zero of the N-extremal solution concentrated in the zeros of the D-function from the Nevanlinna parametrization,…

Classical Analysis and ODEs · Mathematics 2017-01-31 Christian Berg , Jacob S. Christiansen

We study the dynamics of polynomial-like mappings in several variables. A special case of our results is the following theorem. Let f be a proper holomorphic map from an open set U onto a Stein manifold V, $U\subset\subset V$. Assume f is…

Dynamical Systems · Mathematics 2007-05-23 T. C. Dinh , N. Sibony

We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…

Number Theory · Mathematics 2025-02-11 François Brunault , Antonin Guilloux , Mahya Mehrabdollahei , Riccardo Pengo

We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of…

Metric Geometry · Mathematics 2024-12-11 S. Borodachov , P. Boyvalenkov , P. Dragnev , D. Hardin , E. Saff , M. Stoyanova

In this paper we mainly discuss three things. First, there is no canonical norm on the space $H^p_u(\mathbb{D})$. Second, we improve the weak-$*$ convergence of the measures $\mu_{u,r}$. Third, the dilations $f_t$ of the function $f\in…

Complex Variables · Mathematics 2014-09-05 K. R. Shrestha

Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of…

Data Structures and Algorithms · Computer Science 2021-09-16 Nima Anari , Thuy-Duong Vuong

Let $M$ be a smooth compact manifold of dimension $d$ without boundary. We introduce the concept of predominance for Riemannian metrics on $M$, a notion analogous to full Lebesgue measure which, in particular, implies density. We show that…

Dynamical Systems · Mathematics 2022-04-27 Yaiza Canzani , Jeffrey Galkowski

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

Computational Complexity · Computer Science 2018-06-11 Joshua A. Grochow

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…

Probability · Mathematics 2026-01-06 Jürgen Angst , Oanh Nguyen , Guillaume Poly

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

Number Theory · Mathematics 2015-08-24 John Abbott

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

Computational Geometry · Computer Science 2008-12-03 Andrea Vattani

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

A criterion for subnormality of unbounded composition operators in L2-spaces, written in terms of measurable families of probability measures satisfying the so-called consistency condition, is established. It becomes a new characterization…

Functional Analysis · Mathematics 2013-03-27 Piotr Budzynski , Zenon Jan Jablonski , Il Bong Jung , Jan Stochel

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…

Mathematical Physics · Physics 2020-12-24 David Sutter , Omar Fawzi , Renato Renner

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

We consider a general class of spin systems with potentially unbounded real-valued spins, defined via a single-site potential with super-Gaussian tails on general graphs, allowing for both short- and long-range interactions. This class…

Probability · Mathematics 2026-03-30 Christoforos Panagiotis , William Veitch

In this survey article, we review some results and conjectures related to orthogonal polynomials on Cantor sets. The main purpose of this paper is to emphasize the role of equilibrium measures in order to have a general theory of…

Classical Analysis and ODEs · Mathematics 2016-11-08 Gökalp Alpan

We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, P_c :z \mapsto z^d+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the…

Dynamical Systems · Mathematics 2022-02-09 Davoud Cheraghi