Related papers: A note on the extensible no-three-in-line problem

In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\geq 3$, $n \geq 3$,…

In 1975, Erd\H{o}s and Sauer asked to estimate, for any constant $r$, the maximum number of edges an $n$-vertex graph can have without containing an $r$-regular subgraph. In a recent breakthrough, Janzer and Sudakov proved that any…

Let $A\subset [1,N]$ be a set of positive integers with $|A|\gg \sqrt N$. We show that if avoids about $p/2$ residue classes modulo $p$ for each prime $p$, the $A$ must correlate additively with the squares $S=\{n^2:1\leq n\leq \sqrt N\}$,…

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

A discrete subset $S$ of a topological group $G$ is called a {\it suitable set} for $G$ if $S\cup \{e\}$ is closed in $G$ and the subgroup generated by $S$ is dense in $G$, where $e$ is the identity element of $G$. In this paper, the…

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture of F\"{u}redi and Ruszink\'{o}. We also…

It is proved that for infinitely many positive integers n, there exists a circulant graph of order n whose Weisfeiler-Leman dimension is at least c\sqrt{log n} for some positive constant c not depending on n.

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

We prove the existence of a subset of the torus with large sumsets and avoiding all linear patterns. This extends a result of K\"orner, who had shown that for any integer $q \geq 1$, there exists a subset $K$ of $\mathbb R/\mathbb Z$…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…

For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms…

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

We prove that for $n\geq2$ there exists a compact subset $X$ of the closed ball in $R^{2n}$ of radius $\sqrt{2}$, such that $X$ has Hausdorff dimension $n$ and does not symplectically embed into the standard open symplectic cylinder. The…

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

We prove that every finite partition of $\omega$ admit an infinite subset that does not compute a Schnorr random real. We use this result to answer two questions of Brendle, Brooke-Taylor, Ng and Nies and strength a result of Khan and…