Related papers: Extending Erd\H{o}s- Beck's theorem to higher dime…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…
We establish the order of the maximum length of an increasing sequence, bounded by $n$, in which the largest prime divisor of the elements form a decreasing sequence.
Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…
We study the Waldschmidt constant of some configurations in the projective plane. In the first part, we show that the Waldschmidt constant of a set $\mathbb{X}$ of $n$ points where at least $n-3$ points among them lie on a line is either…
The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…
The Newton line and the associated theorems by Newton and Gauss for tetragons and quadrilaterals are closely linked to some other theorems of Euclidean geometry: a theorem by Bocher on the existence of a nine-point conic of a quadrangle, a…
We prove some novel multi-parameter point-line incidence estimates in vector spaces over finite fields. While these could be seen as special cases of higher-dimensional incidence results, they outperform their more general counterparts in…
A Berge $k$-factor in a hypergraph is a generalization of a $k$-factor in a graph. In this paper, we study the problem of determining the values $k$ such that every $\lambda$-edge-connected $r$-regular hypergraph $\HH$ with $k|V(\HH)|$ even…
We prove a Cayley-Bacharach-type theorem for points in projective space $\mathbb{P}^n$ that lie on a complete intersection of $n$ hypersurfaces. This is made possible by new bounds on the growth of the Hilbert function of almost complete…
A Barak-Erd\H{o}s graph is a directed acyclic version of the Erd\H{o}s-R\'enyi random graph. It is obtained by performing independent bond percolation with parameter $p$ on the complete graph with vertices $\{1,...,n\}$, in which the edge…
We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree $d$, over any global field. In particular, we focus on the affine hypersurface situation by…
A new way to define the notion of $\C$-orthocenter will be displayed by studying some propierties of four points in the plane which allows to extend the notion of Euler's line, the Six Point Circles and the three-circles theorem, for normed…
We prove that bounded solutions to an overdetermined fully nonlinear free boundary problem in the plane are one dimensional. Our proof relies on maximum principle techniques and convexity arguments.
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…
We show that $m$ points and $n$ two-dimensional algebraic surfaces in $\mathbb{R}^4$ can have at most $O(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n)$ incidences, provided that the algebraic surfaces behave like pseudoflats with $k$ degrees…
The main object of this paper is to determine the maximum number of $\{0,\pm 1\}$-vectors subject to the following condition. All vectors have length $n$, exactly $k$ of the coordinates are $+1$ and one is $-1$, $n \geq 2k$. Moreover, there…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…