English
Related papers

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

200 papers

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

Combinatorics · Mathematics 2026-03-20 Gennian Ge , Jialuo Wang , Zixiang Xu

In 1991, Baker and Harman proved, under the assumption of the generalized Riemann hypothesis, that $\max_{ \theta \in [0,1) }\left|\sum_{ n \leq x } \mu(n) e(n \theta) \right| \ll_\epsilon x^{3/4 + \epsilon}$. The purpose of this note is to…

Number Theory · Mathematics 2017-12-01 Sam Porritt

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Combinatorics · Mathematics 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Combinatorics · Mathematics 2020-02-26 Simone Costa , Marco Dalai

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $ m=2$ and…

Functional Analysis · Mathematics 2024-02-28 Beata Deregowska , Barbara Lewandowska

For an $r$-uniform hypergraph $H$, let $\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\tau^{(m)}(H)$ denote the minimum size of a collection…

Combinatorics · Mathematics 2022-10-25 Abdul Basit , Daniel McGinnis , Henry Simmons , Matt Sinnwell , Shira Zerbib

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

Number Theory · Mathematics 2022-12-13 Wei Zhang

For a $k$-uniform hypergraph $F$ and positive integers $s$ and $N$, the generalized Erd\H{o}s-Rogers function $f^{(k)}_{F,s}(N)$ denotes the largest integer $m$ such that every $K_s^{(k)}$-free $k$-graph on $N$ vertices contains an $F$-free…

Combinatorics · Mathematics 2026-04-08 Longma Du , Xinyu Hu , Ruilong Liu , Guanghui Wang

Let $g:\mathbb{N}\to\{-1,1\}$ be a completely multiplicative function, $\mu$ be the M\"obius function and $\mu_2^2(n)$ be the indicator that $n$ is cubefree. We prove that $f=\mu^2g$ and $f=\mu_2^2g$ have unbounded partial sums. Our proofs…

Number Theory · Mathematics 2021-09-14 Marco Aymone

Let $\mathbf{A}=\{A_i\}_{i=1}^{\infty}$ be a sequence of sets with each $A_i$ being a non-empty collection of $0$-$1$ sequences of length $i$. For $x\in [0,1)$, the maximal run-length function $\ell_n(x,\mathbf{A})$ (with respect to…

Classical Analysis and ODEs · Mathematics 2022-12-12 Yu-Feng Wu

In this note, we study a quantitative extension of the John-Nirenberg inequality for the Hardy-Littlewood maximal function of a $\operatorname{BMO}$ function. More precisely, for every nonconstant locally integrable function $f$ such that…

Classical Analysis and ODEs · Mathematics 2025-11-27 Alejandro Claros

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve the current…

Number Theory · Mathematics 2022-10-26 Régis de la Bretèche , Gérald Tenenbaum

Kalton and Roberts [Trans. Amer. Math. Soc., 278 (1983), 803--816] proved that there exists a universal constant $K\leqslant 44.5$ such that for every set algebra $\mathcal{F}$ and every 1-additive function $f\colon \mathcal{F}\to \mathbb…

Functional Analysis · Mathematics 2020-05-20 Michal Gnacik , Marcin Guzik , Tomasz Kania

We solve a problem posed by A. Bonilla and K.-G. Grosse-Erdmann by constructing an entire function $f$ that is frequently hypercyclic with respect to the differentiation operator, and satisfies $M_f(r)\leq\displaystyle ce^r r^{-1/4}$, where…

Functional Analysis · Mathematics 2011-09-05 David Drasin , Eero Saksman

In this note we investigate the asymptotic behavior of the number of maximum modulus points, of an entire function, sitting in a disc of radius $r$. In 1964, Erd\Humlaut{o}s asked whether there exists a non-monomial function so that this…

Complex Variables · Mathematics 2023-09-28 Adi Glücksam , Leticia Pardo-Simón

Clunie and Hayman proved that if the spherical derivative of an entire function has order of growth sigma then the function itself has order at most sigma+1. We extend this result to holomorphic curves in projective space of dimension n…

Complex Variables · Mathematics 2012-04-16 Matthew Barrett , Alexandre Eremenko

By combining the planebrush argument of Katz and Zahl \cite{katz21} with the decoupling-incidence method of Wang and Wu \cite{WangWu2024}, we derive new bounds for the Fourier restriction problem and the Bochner--Riesz problem, extending…

Classical Analysis and ODEs · Mathematics 2025-12-01 Tainara Borges , Tiklung Chan , Mingfeng Chen , Diankun Liu , Yakun Xi , Yufei Zhan

For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…

Number Theory · Mathematics 2026-04-29 Ji Ho Bae

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

Discrete Mathematics · Computer Science 2024-05-22 Rishikesh Gajjala , Jayanth Ravi
‹ Prev 1 2 3 10 Next ›