English
Related papers

Related papers: Good weights for the Erd\H{o}s discrepancy problem

200 papers

In the present paper we shall study a variational problem relating the weighted Hardy inequalities with sharp missing terms. As weights we treat non-doubling functions of the distance to the boundary of bounded domain.

Analysis of PDEs · Mathematics 2023-12-13 Hiroshi Ando , Toshio Horiuchi

Inspired by the Erd\H{o}s' problem in Ramsey theory, we propose a dynamical version of the problem and answer it positively for circle maps.

Dynamical Systems · Mathematics 2025-12-30 Enhui Shi , Hui Xu

We study some variants of the Erd\H{o}s similarity problem. We pose the question if every measurable subset of the real line with positive measure contains a similar copy of an infinite geometric progression. We construct a compact subset…

Metric Geometry · Mathematics 2023-10-20 Alex Burgin , Samuel Goldberg , Tamás Keleti , Connor MacMahon , Xianzhi Wang

In this article, we investigate the theory of weighted functions of bounded variation (BV), as introduced by Baldi [Ba01]. Depending on the theorem, we impose lower semicontinuity and/or a pointwise A1 condition on the weight. Our…

Classical Analysis and ODEs · Mathematics 2026-05-19 Simon Bortz , Matthew Gossett , Joseph Kasel , Kabe Moen

We study boundary value problems for degenerate elliptic equations and systems with square integrable boundary data. We can allow for degeneracies in the form of an $A_{2}$ weight. We obtain representations and boundary traces for solutions…

Classical Analysis and ODEs · Mathematics 2014-04-16 Pascal Auscher , Andreas Rosén , David Rule

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

Data Structures and Algorithms · Computer Science 2021-10-29 Lorenzo Beretta , Jakub Tětek

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

Combinatorics · Mathematics 2025-05-13 Sean Dewar , Nora Frankl , Samuel Mansfield , Anthony Nixon , Jonathan Passant , Audie Warren

We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…

Number Theory · Mathematics 2026-01-27 Nat Sothanaphan

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

Combinatorics · Mathematics 2020-09-09 Shelby Kilmer , Caleb Marshall , Steven Senger

We establish the well-posedness of linear elliptic equations with critical-order drifts in $L^d$ and positive zero-order coefficients in $L^1$ or $L^{\frac{2d}{d+2}}$, where classical methods are often too restrictive. Our approach relies…

Analysis of PDEs · Mathematics 2026-04-07 Haesung Lee

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n\geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n \geq1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2015-07-24 Christoph Aistleitner , Gerhard Larcher

Let $\mathcal{A}\subset\mathbb{R}_{\geqslant1}$ be a countable set such that $\limsup_{x\to\infty}\frac{1}{\log x}\sum_{\alpha\in\mathcal{A}\cap[1,x]}\frac{1}{\alpha}>0$. We prove that, for every $\varepsilon>0$, there exist infinitely many…

Number Theory · Mathematics 2025-02-14 Dimitris Koukoulopoulos , Youness Lamzouri , Jared Duker Lichtman

The main purpose of this survey is to gather results on the boundedness of the Bergman projection. First, we shall go over some equivalent norms on weighted Bergman spaces $A^p_\omega$ which are useful in the study of this question. In…

Complex Variables · Mathematics 2015-01-19 José Ángel Peláez , Jouni Rättyä

We show that the sequence of ratios $d(n+1) / d(n)$ of consecutive values of the divisor function attains every positive rational infinitely many times. This confirms a prediction of Erd\H{o}s.

Number Theory · Mathematics 2025-10-31 Sean Eberhard

Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Dmitry Chistikov , Stefan Kiefer , Andrzej S. Murawski , David Purser

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

Optimization and Control · Mathematics 2026-05-25 Zhou Wei , Michel Thera , Jen-Chih Yao

Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…

Number Theory · Mathematics 2025-03-18 Mathias L. Laursen

We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…

Probability · Mathematics 2018-11-06 Christoph H. Lampert , Liva Ralaivola , Alexander Zimin

We consider the Tur\'an-type problem of bounding the size of a set $M \subseteq \mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \subseteq \mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\H{o}s-Stone…

Combinatorics · Mathematics 2017-10-12 Hong Liu , Sammy Luo , Peter Nelson , Kazuhiro Nomoto