English
Related papers

Related papers: Generalizing the Clunie--Hayman construction in an…

200 papers

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

Number Theory · Mathematics 2017-07-06 Hajime Kaneko , Thomas Stoll

We examine the large systole problem, which concerns compact hyperbolic Riemannian surfaces whose systole, the length of the shortest noncontractible loops, grows logarithmically in genus. The generalization of a construction of Buser and…

Differential Geometry · Mathematics 2014-09-12 Shotaro Makisumi

We generalize the notion of Hilbert-Kunz multiplicity of a graded triple $(M,R,I)$ in characteristic $p>0$ by proving that for any complex number $y$, the limit $$\underset{n \to \infty}{\lim}(\frac{1}{p^n})^{\text{dim}(M)}\sum \limits_{j=…

Commutative Algebra · Mathematics 2024-06-21 Alapan Mukhopadhyay

We give a simple proof of the fact that an "$f$-estimate" for the $\bar\partial$-Neumann problem implies a lower bound on the geomatric type of the boundary along any complex one dimensional variety. The proof uses the existence of peak…

Complex Variables · Mathematics 2017-04-17 Tran Vu Khanh

We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for…

Probability · Mathematics 2012-09-03 Andrey M. Zubkov , Alexander A. Serov

In 1980 Carleson posed a question on the minimal regularity of an initial data function in a Sobolev space $H^s(\mathbb{R}^n)$ that implies pointwise convergence for the solution of the linear Schr\"odinger equation. After progress by many…

Classical Analysis and ODEs · Mathematics 2022-04-11 Chen An , Rena Chu , Lillian B. Pierce

We establish that \[\sum_{m=1}^\infty \sum_{n=1}^\infty a_m \overline{a_n} \frac{mn}{(\max(m,n))^3} \leq \frac{4}{3}\sum_{m=1}^\infty |a_m|^2\] holds for every square-summable sequence of complex numbers $a = (a_1,a_2,\ldots)$ and that the…

Classical Analysis and ODEs · Mathematics 2023-12-08 Ole Fredrik Brevig

We derive a lower bound for the subword complexity of the base-$b$ expansion ($b\geq 2$) of all real numbers whose irrationality exponent is equal to 2. This provides a generalization of a theorem due to Ferenczi and Mauduit. As a…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski

Let L(s) = L(s, \pi) be the standard L-function of a cuspidal representation \pi of GL(m,A) where A denotes the ad\`eles of the field of rationals. We consider the integral, on the real line Re(s)= 1/2, of the squared absolute value of…

Number Theory · Mathematics 2023-01-04 Laurent Clozel

We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the…

Combinatorics · Mathematics 2026-05-29 Jared DeLeo , Owen Henderschedt , Chris Wells

Recent progress on Vinogradov's mean value theorem has resulted in improved estimates for exponential sums of Weyl type. We apply these new estimates to obtain sharper bounds for the function $H(k)$ in the Waring--Goldbach problem. We…

Number Theory · Mathematics 2017-05-17 Angel V. Kumchev , Trevor D. Wooley

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Combinatorics · Mathematics 2024-02-06 Oliver Janzer , Benny Sudakov

The Landau-Kolmogorov problem consists of finding the upper bound $M_k$ for the norm of intermediate derivative $|f^{(k)}|$, when the bounds $|f| \le M_0$ and $|f^{(n)}| \le M_n$, for the norms of the function and of its higher derivative,…

Numerical Analysis · Mathematics 2012-10-30 Alexei Shadrin

The Riemann-Lebesque Theorem is commonly proved in a few strokes using the theory of Lebesque integration. Here, the upper bound $2\pi|c_k(f)|\le S_k(f)-s_k(f)$ for the Fourier coefficients $c_k$ is proved in terms of majoring and minoring…

funct-an · Mathematics 2008-02-03 Maurice H. P. M. van Putten

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…

Combinatorics · Mathematics 2017-10-11 Mykhaylo Tyomkyn

Let $F(x,y)$ be an irreducible form of degree $r\geq 3$ and having $s+1$ non-zero coefficients. Let $h\geq 1$ be an integer and consider the Thue inequality $$|F(x,y)|\leq h.$$ Following the seminal work of Thue in 1909, several papers were…

Number Theory · Mathematics 2025-05-23 N. Saradha , Divyum Sharma

Given a subset $A \subseteq \{0,1\}^n$, let $\mu(A)$ be the maximal ratio between $\ell_4$ and $\ell_2$ norms of a function whose Fourier support is a subset of $A$. We make some simple observations about the connections between $\mu(A)$…

Combinatorics · Mathematics 2018-06-12 Naomi Kirshner , Alex Samorodnitsky

The classical Erd\H{o}s-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and…

Combinatorics · Mathematics 2023-05-01 Simone Costa , Stefano Della Fiore

Let $e(n,s)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $n$-element set that contains no $s$ pairwise disjoint members. In 1968, answering a question of Erd\H{o}s, Kleitman determined $e(sm-1,s)$ and $e(sm,s)$ for…

Combinatorics · Mathematics 2026-05-07 Andrey Kupavskii , Georgy Sokolov

Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…

Metric Geometry · Mathematics 2024-10-16 Daniel Galicer , Joaquín Singer