Related papers: The Sharp Erd\H{o}s-Tur\'an Inequality
The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Tur\'an function, the minimum codegree threshold and the…
An ordered graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Tur\'an problem, first studied by Pach and Tardos, asks for the maximum number $\text{ex}_<(n,H)$ of edges in an ordered graph on $n$ vertices…
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…
The Hardy-Rellich inequality in the whole space with the best constant was firstly proved by Tertikas and Zographopoulos in Adv. Math. (2007) in higher dimensions $N\geq 5$. Then it was extended to lower dimensions $N\in \{3, 4\}$ by…
The Tur\'an number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P_k be the path with k vertices, the square P^2_k of P_k is obtained by joining the pairs of vertices…
In this paper, we will establish the best constants for certain classes of weighted Moser-Trudinger inequalities on the entire Euclidean spaces $\mathbb{R}^N$. We will also prove the existence of maximizers of these sharp weighted…
Approximating distributions from their samples is a canonical statistical-learning problem. One of its most powerful and successful modalities approximates every distribution to an $\ell_1$ distance essentially at most a constant times…
The Tur\'an number of a graph H, ex(n;H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P_l denote a path on l vertices, and kP_l denote k vertex-disjoint copies of P_l. We determine…
The classical Erd\H{o}s-Szekeres theorem dating back almost a hundred years states that any sequence of $(n-1)^2+1$ distinct real numbers contains a monotone subsequence of length $n$. This theorem has been generalised to higher dimensions…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Given $r$-uniform hypergraphs $G$ and $H$ the Tur\'an number $\rm ex(G, H)$ is the maximum number of edges in an $H$-free subgraph of $G$. We study the typical value of $\rm ex(G, H)$ when $G=G_{n,p}^{(r)}$, the Erd\H{o}s-R\'enyi random…
The classical Erd\H os-Ko-Rado (EKR) Theorem states that if we choose a family of subsets, each of size (k), from a fixed set of size (n (n > 2k)), then the largest possible pairwise intersecting family has size (t ={n-1\choose k-1}). We…
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 study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the…
In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\H{o}s-Stone-Bollob\'as theorem, several stability…
In this article, we prove some total variation inequalities for maximal functions. Our results deal with two possible generalizations of the results contained in Aldaz and P\'erez L\'azaro's work, one of whose considers a variable…
Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…
Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…
We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…