相关论文: Erd\H{o}s's integer dilation approximation problem…

Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$ and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{n-1}{2} \right \rfloor)\}$. Because $h(n,d)$ is quadratic in…

Erd\H{o}s \cite{MR168482} proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal{F}$ of (real or complex) analytic functions, such that $\big\{ f(x) \ : \ f \in \mathcal{F} \big\}$ is…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

Given a sequence $\mathbf{k} := (k_1,\ldots,k_s)$ of natural numbers and a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

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…

James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

A classic theorem of Erd\H{o}s and P\'osa (1965) states that every graph has either $k$ vertex-disjoint cycles or a set of $O(k \log k)$ vertices meeting all its cycles. While the standard proof revolves around finding a large `frame' in…

The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b, c, d \in…

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…

The Erd\H{o}s-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a…

Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup \{0\}\right)+h$ contains infinitely many prime numbers.…

Erd\H{o}s conjectured in 1945 that for any unit vectors $v_1, \dotsc, v_n$ in $\mathbb{R}^2$ and signs $\varepsilon_1, \dotsc, \varepsilon_n$ taken independently and uniformly in $\{-1,1\}$, the random Rademacher sum $\sigma = \varepsilon_1…

We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…

The Conjecture of Hadwiger implies that the Hadwiger number $h$ times the independence number $\alpha$ of a graph is at least the number of vertices $n$ of the graph. In 1982 Duchet and Meyniel proved a weak version of the inequality,…

Let $\alpha$ be an irrational real number. We show that the set of $\epsilon$-badly approximable numbers \[ \mathrm{Bad}^\varepsilon (\alpha) := \{x\in [0,1]\, : \, \liminf_{|q| \to \infty} |q| \cdot \| q\alpha -x \| \geq \varepsilon \} \]…

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

The research in the subfield of analytic number theory around error term of summation of sigma functions possesses a history which can be dated back to the mid-19th century when Dirichlet provided an $O(\sqrt{n})$ estimation of error term…

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…