相关论文: Random linear combinations of functions from $L_1$

The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

In this paper, we prove maximal inequalities and study the functional central limit theorem for the partial sums of linear processes generated by dependent innovations. Due to the general weights, these processes can exhibit long-range…

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

Kernel methods give powerful, flexible, and theoretically grounded approaches to solving many problems in machine learning. The standard approach, however, requires pairwise evaluations of a kernel function, which can lead to scalability…

We introduce the notion of a random matrix-valued multiplicative function, generalizing Rademacher random multiplicative functions to matrices. We provide an asymptotic for the second moment based on a linear recurrence property for…

The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. This problem is very important in applications but there is no systematic study of it. We present here a new technique, which…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. Even though this problem is extremely important in applications, its systematic study has begun recently. In this paper we…

This paper surveys recent developments in the sampling discretization of integral and uniform norms for functions in general finite-dimensional spaces. These results generalize the classical Marcinkiewicz-Zygmund inequalities for…

There has been a large amount of interest, both in the past and particularly recently, into the power of different families of universal approximators, e.g. ReLU networks, polynomials, rational functions. However, current research has…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

We consider the asymptotic behavior of the expectation of the maximum for a special assignment process with constant or i.i.d. coefficients. We show how it depends on the coefficients' distribution.

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…