Related papers: Estimates for Norms of Random Polynomials

In this text we study the regularity of matrices with special polynomial entries. Barring some mild conditions we show that these matrices are regular if a natural limit size is not exceeded. The proof draws connections to generalized…

In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…

We provide an explicit infinite family of integers $m$ such that all the polynomials of ${\mathbb F}_{2^n}[x]$ of degree $m$ have maximal differential uniformity for $n$ large enough. We also prove a conjecture of the third author in these…

We introduce the notions of semi-uniform input-to-state stability and its subclass, polynomial input-to-state stability, for infinite-dimensional systems. We establish a characterization of semi-uniform input-to-state stability based on…

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…

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…

We provide a unified, probabilistic approach using renewal theory to derive some novel limits of sums for the normalized binomial coefficients and for the normalized Eulerian numbers. We also investigate some corresponding results for their…

We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…

The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…

We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…

We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…

Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…

The concept of a gauge invariant symmetric random norm is elaborated in this paper. We introduce norm processes and show that this kind of stochastic processes are closely related to gauge invariant symmetric random norms. We construct a…

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…

We consider randomized Verblunsky parameters for orthogonal polynomials on the unit circle as they relate to the problem of Steklov, bounding the polynomials' uniform norm independent of $n$.

In this paper, we prove optimal local universality for roots of random polynomials with arbitrary coeffcients of polynomial growth. As an application, we derive, for the first time, sharp estimates for the number of real roots of these…