English
Related papers

Related papers: Supremum of Random Dirichlet Polynomials with Sub-…

200 papers

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…

Probability · Mathematics 2008-02-01 Mikhail Lifshits , Michel Weber

We study the supremum of some random Dirichlet polynomials with independent coefficients and obtain sharp upper and lower bounds for supremum expectation thus extending the results from our previous work (see…

Probability · Mathematics 2009-04-23 Mikhail Lifshits , Michel Weber

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and…

Number Theory · Mathematics 2023-02-24 Jacques Benatar , Alon Nishry

We study extreme values of Dirichlet polynomials with multiplicative coefficients, namely \[D_N(t) : = D_{f,\, N}(t)= \frac{1}{\sqrt{N}} \sum_{n\leqslant N} f(n) n^{it}, \] where $f$ is a completely multiplicative function with $|f(n)|=1$…

Number Theory · Mathematics 2023-03-14 Max Wenqiang Xu , Daodao Yang

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…

Number Theory · Mathematics 2017-07-13 Michel Weber

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…

Functional Analysis · Mathematics 2024-05-08 E. D. Kosov , V. N. Temlyakov

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Numerical Analysis · Mathematics 2021-12-14 Boris Kashin , Sergei Konyagin , Vladimir Temlyakov

Gaussian random processes which variances reach theirs maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximums of theirs trajectories have been evaluated using Double Sum Method…

Probability · Mathematics 2019-01-29 E. Hashorva , S. Kobelkov , V. I. Piterbarg

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

In this paper, we consider the distribution of the supremum of non-stationary Gaussian processes, and present a new theoretical result on the asymptotic behaviour of this distribution. Unlike previously known facts in this field, our main…

Probability · Mathematics 2020-05-25 Valentin Konakov , Vladimir Panov , Vladimir Piterbarg

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos

Gaussian random fields on Euclidean spaces whose variances reach their maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximum of theirs trajectories have been evaluated using…

Probability · Mathematics 2019-04-12 Sergey G. Kobelkov , Vladimir I. Piterbarg

We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\subseteq\mathbb{R}^d$, we compute a $(1+\varepsilon)$-factor approximation to $\mathop…

Data Structures and Algorithms · Computer Science 2015-03-27 Raghu Meka

Let $\mu(t) = \sum_{\tau\in S} \alpha_\tau \delta(t-\tau)$ denote an $|S|$-atomic measure defined on $[0,1]$, satisfying $\min_{\tau\neq \tau'}|\tau - \tau'|\geq |S|\cdot n^{-1}$. Let $\eta(\theta) = \sum_{\tau\in S} a_\tau D_n(\theta -…

Numerical Analysis · Mathematics 2020-01-07 Augustin Cosse

We give a dimension-independent sparsification result for suprema of centered Gaussian processes: Let $T$ be any (possibly infinite) bounded set of vectors in $\mathbb{R}^n$, and let $\{\boldsymbol{X}_t := t \cdot \boldsymbol{g} \}_{t\in…

Machine Learning · Statistics 2025-11-11 Anindya De , Shivam Nadimpalli , Ryan O'Donnell , Rocco A. Servedio

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$ and study the distribution of zeros of Dirichlet polynomials $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ corresponding to these functions. We prove that the…

Number Theory · Mathematics 2019-12-10 Arindam Roy , Akshaa Vatwani

In the Random Subset Sum Problem, given $n$ i.i.d. random variables $X_1, ..., X_n$, we wish to approximate any point $z \in [-1,1]$ as the sum of a suitable subset $X_{i_1(z)}, ..., X_{i_s(z)}$ of them, up to error $\varepsilon$. Despite…

Neural and Evolutionary Computing · Computer Science 2022-11-18 Luca Becchetti , Arthur Carvalho Walraven da Cunha , Andrea Clementi , Francesco d'Amore , Hicham Lesfari , Emanuele Natale , Luca Trevisan

A well-known longstanding conjecture on the supremum of the tails of normalized sums of independent Rademacher random variables is disproved. A related conjecture, also recently disproved, is discussed.

Probability · Mathematics 2017-01-17 Iosif Pinelis

We compute the leading asymptotics of the maximum of the (centered) logarithm of the absolute value of the characteristic polynomial, denoted $\Psi_N$, of the Ginibre ensemble as the dimension $N$ of the random matrix tends to infinity. The…

Probability · Mathematics 2020-08-26 Gaultier Lambert
‹ Prev 1 2 3 10 Next ›