Related papers: Arithmetic Progressions in the Graphs of Slightly …

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

In this paper we introduce and study a certain type of sub semi-group of $\mathbb{R}/\mathbb{Z}$ which turns out to be closely related to \sz's theorem on arithmetic progressions.

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

In 2022, Gao, Huo, Liu, and Ma proved that every graph with minimum degree at least $k+1$ contains $k$ admissible cycles, where a set of $k$ cycles is said to be admissible if their lengths form an arithmetic progression with common…

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In this work, we extend their result, establishing similar bounds…

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

A curve has the increasing chord property if for any points $a,b,c,d$ in this order on the curve, the distance of $a,d$ is not smaller than that of $b,c$. Answering a conjecture of Larman and McMullen, Rote proved in 1994 that the arclength…

In the graph stream model of computation, an algorithm processes the edges of an input graph in one or more sequential passes while using a memory sublinear in the input size. This model poses significant challenges for constructing long…

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

Approximating the graph diameter is a basic task of both theoretical and practical interest. A simple folklore algorithm can output a 2-approximation to the diameter in linear time by running BFS from an arbitrary vertex. It has been open…

We consider exponential systems $E\left(\Lambda\right)=\left\{ e^{i\lambda t}\right\} _{\lambda\in\Lambda}$ for $\Lambda\subset\mathbb{Z}$. It has been shown by Londner and Olevskii in [9] that there exists a subset of the circle, of…

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

Introduced in the mid-1970's as an intermediate step in proving a long-standing conjecture on arithmetic progressions, Szemer\'edi's regularity lemma has emerged over time as a fundamental tool in different branches of graph theory,…

In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…

We investigate the limiting behavior of multiple ergodic averages along sparse sequences evaluated at prime numbers. Our sequences arise from smooth and well-behaved functions that have polynomial growth. Central to this topic is a…

Wall's theorem on arithmetic progressions says that if $0.a_1a_2a_3\dots$ is normal, then for any $k,\ell\in \mathbb{N}$, $0.a_ka_{k+\ell}a_{k+2\ell}\dots$ is also normal. We examine a converse statement and show that if…