相关论文: Estimates for Norms of Random Polynomials

This article addresses an equidistribution problem concerning the zeros of systems of random holomorphic sections of positive line bundles on compact K\"{a}hler manifolds and random polynomials on $\mathbb{C}^{m}$ in the setting of the…

In this article, we consider the following family of random trigonometric polynomials $p_n(t,Y)=\sum_{k=1}^n Y_{k,1} \cos(kt)+Y_{k,2}\sin(kt)$ for a given sequence of i.i.d. random variables $\{Y_{k,1},Y_{k,2}\}_{k\ge 1}$ which are centered…

Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…

In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy--Littlewood constants for $2$-homogeneous polynomials on $\ell_p^2$ spaces, $2<p\leq\infty$…

In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.

This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…

A theorem of Hunter ensures that the complete homogeneous symmetric polynomials of even degree are positive definite functions. A probabilistic interpretation of Hunter's theorem suggests a broad generalization: the construction of…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Conjectured links between the distribution of values taken by the characteristic polynomials of random orthogonal matrices and that for certain families of L-functions at the centre of the critical strip are used to motivate a series of…

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

Normal variance mixtures are a class of multivariate distributions that generalize the multivariate normal by randomizing (or mixing) the covariance matrix via multiplication by a non-negative random variable W. The multivariate t…

In this paper non-asymptotic exact rearrangement invariant norm estimates are derived for the maximum distribution of the family elements of some rearrangement invariant (r.i.) space over unbounded measure in the entropy terms and in the…

We present \textit{universal} estimators for the statistical mean, variance, and scale (in particular, the interquartile range) under pure differential privacy. These estimators are universal in the sense that they work on an arbitrary,…

In this paper we provide a complete answer to a question by Heyman and Shparlinski concerning the natural density of polynomials which are irreducible by Eisenstein's criterion after applying some shift. The main tool we use is a local to…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…

The advent of data science has spurred interest in estimating properties of distributions over large alphabets. Fundamental symmetric properties such as support size, support coverage, entropy, and proximity to uniformity, received most…