English
Related papers

Related papers: On the largest critical value of $T_n^{(k)}$

200 papers

Here we study the quantity $$ \tau_{n,k}:=\frac{|T_n^{(k)}(\omega_{n,k})|}{T_n^{(k)}(1)}\,, $$ where $T_n$ is the $n$-th Chebyshev polynomial of the first kind and $\omega_{n,k}$ is the largest zero of $T_n^{(k+1)}$. Since the absolute…

Classical Analysis and ODEs · Mathematics 2022-03-11 Nikola Naidenov , Geno Nikolov

By employing the assessment of the asymptotic size of various sums of G\'{a}l studied by La Bret\`eche and Tenenbaum, we provide an improvement on the recent result of A. Bondarenko, P. Darbar, M. V. Hagen, W. Heap, and K. Seip regarding…

Number Theory · Mathematics 2023-07-17 Patrick Nyadjo Fonga

We study i.i.d. sums $\tau_k$ of nonnegative variables with index $0$: this means $\mathbf{P}(\tau_1=n) = \varphi(n) n^{-1}$, with $\varphi(\cdot)$ slowly varying, so that $\mathbf{E}(\tau_1^\varepsilon)=\infty$ for all $\varepsilon>0$. We…

Probability · Mathematics 2016-11-08 Kenneth S. Alexander , Quentin Berger

Let $S(\sigma,t)=\frac{1}{\pi}\arg\zeta(\sigma+it)$ be the argument of the Riemann zeta function at the point $\sigma+it$ of the critical strip. For $n\geq 1$ and $t>0$ we define $$ S_{n}(\sigma,t) = \int_0^t S_{n-1}(\sigma,\tau)\,d\tau\, +…

Number Theory · Mathematics 2018-08-01 Andrés Chirre

We consider the problem of estimating a large rank-one tensor ${\boldsymbol u}^{\otimes k}\in({\mathbb R}^{n})^{\otimes k}$, $k\ge 3$ in Gaussian noise. Earlier work characterized a critical signal-to-noise ratio $\lambda_{Bayes}= O(1)$…

Statistics Theory · Mathematics 2018-01-26 Gerard Ben Arous , Song Mei , Andrea Montanari , Mihai Nica

Given a probability measure $\mu$ on the unit circle $\mathbb{T}$, consider the reproducing kernel $k_{\mu,n}(z_1, z_2)$ in the space of polynomials of degree at most $n-1$ with the $L^2(\mu)$-inner product. Let $u, v \in \mathbb{C}$. It is…

Complex Variables · Mathematics 2023-06-27 Roman Bessonov

We study optimal dimensionless inequalities $$ \|f\|_{U^k} \leq \|f\|_{\ell^{p_{k,n}}} $$ that hold for all functions $f\colon\mathbb{Z}^d\to\mathbb{C}$ supported in $\{0,1,\ldots,n-1\}^d$ and estimates $$ \|1_A\|_{U^k}^{2^k}\leq…

Combinatorics · Mathematics 2025-06-18 Adrian Beker , Tonći Crmarić , Vjekoslav Kovač

Let $(Z^{(n)}_k)_{1 \leq k \leq n}$ be a random set of points and let $\mu_n$ be its \emph{empirical measure}: $$\mu_n = \frac{1}{n} \sum_{k=1}^n \delta_{Z^{(n)}_k}. $$ Let $$P_n(z) := (z - Z^{(n)}_1)\cdots (z - Z^{(n)}_n)\quad…

Probability · Mathematics 2024-07-09 André Galligo , Joseph Najnudel , Truong Vu

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

Combinatorics · Mathematics 2024-11-06 Jop Briët , Davi Castro-Silva

Let $S(\sigma,t)=\frac{1}{\pi}\arg\zeta(\sigma+it)$ be the argument of the Riemann zeta-function at the point $\sigma+it$ in the critical strip. For $n\geq 1$ and $t>0$, we define \begin{equation*} S_{n}(\sigma,t) = \int_0^t…

Number Theory · Mathematics 2021-03-18 Andrés Chirre , Kamalakshya Mahatab

For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…

Combinatorics · Mathematics 2022-06-08 József Balogh , Robert A. Krueger , Haoran Luo

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

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

Number Theory · Mathematics 2007-06-28 Johan Andersson

Fix integers $1\le k<n$, and numbers $a,s$ satisfying $0<s<\min\{k,a\}$. The problem of exceptional set estimate is to determine \[T(a,s):=\sup_{A\subset \mathbb{R}^n\ \text{dim}A=a}\text{dim}(\{ V\in G(k,n): \text{dim}(\pi_V(A))<s \}). \]…

Classical Analysis and ODEs · Mathematics 2024-02-12 Shengwen Gan

It is shown that the maximum of $|\zeta(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain…

Number Theory · Mathematics 2017-10-18 Andriy Bondarenko , Kristian Seip

Let $\mathcal{P}_k(n)$ denote the set of partitions of $n$ whose largest part is bounded by $k,$ which are in well-known bijection with $(k+1)$-cores $\mathcal{C}_k$. We study a growth process on $\mathcal{C}_k$, whose stationary…

Combinatorics · Mathematics 2026-01-01 Svante Linusson , Alperen Özdemir

Let $(\tau_n)_n$ be a sequence of real numbers in $(1,+\infty)$. Using potential theoretic methods, we prove quantitative results - Bernstein-Walsh type theorems - about uniform approximation by polynomials of the form $\sum_{k=\lfloor…

Complex Variables · Mathematics 2025-05-21 Stéphane Charpentier , Konstantinos Maronikolakis

Given positive integers $n\ge 2k$, the {\it Kneser graph} $KG_{n,k}$ is a graph whose vertex set is the collection of all $k$-element subsets of the set $\{1,\ldots, n\}$, with edges connecting pairs of disjoint sets. One of the classical…

Combinatorics · Mathematics 2021-07-20 Sergei Kiselev , Andrey Kupavskii

The $n$-linear Bohnenblust-Hille inequality asserts that there is a constant $C_{n}\in\lbrack1,\infty)$ such that the $\ell_{\frac{2n}{n+1}}$-norm of $(U(e_{i_{^{1}}},...,e_{i_{n}}))_{i_{1},...i_{n}=1}^{N}$is bounded above by $C_{n}$ times…

Functional Analysis · Mathematics 2015-10-01 Daniel Nunez-Alarcon , Daniel Pellegrino , Juan Seoane-Sepulveda , Diana M. Serrano-Rodriguez

In the late eighties John Kingman studied the problem of maxima of a quadratic form, with independent, uniformly distributed, coefficients, on a simplex of growing dimension $n$. In particular, he proved that the largest support size…

Probability · Mathematics 2019-07-10 Boris Pittel
‹ Prev 1 2 3 10 Next ›