Related papers: Covering points by hyperplanes and related problem…

By Hartman--Nirenberg's theorem, any complete flat hypersurface in Euclidean space must be a cylinder over a plane curve. However, if we admit some singularities, there are many non-trivial examples. Flat fronts are flat hypersurfaces with…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

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…

In a recent paper of Akhunzhanov and Shatskov the two-dimensional Dirichlet spectrum with respect to Euclidean norm was defined. We consider an analogous definition for arbitrary norms on $\mathbb{R}^2$ and prove that, for each such norm,…

Under a hypothesis on $k$, $d$ and $n$ that is almost the best possible, we prove that for every smooth degree $d$ hypersurface in $P^n$, the $k$-plane sections dominate the moduli space of degree $d$ hypersurface in $P^k$. Using this we…

We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

Let $X$ be an arbitrary smooth hypersurface in $\mathbb{C} \mathbb{P}^n$ of degree $d$. We prove the de Jong-Debarre Conjecture for $n \geq 2d-4$: the space of lines in $X$ has dimension $2n-d-3$. We also prove an analogous result for…

We study the complement problem in projective spaces $\mathbb{P}^n$ over any algebraically closed field: If $H, H' \subseteq \mathbb{P}^n$ are irreducible hypersurfaces of degree $d$ such that the complements $\mathbb{P}^n \setminus H$,…

The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…

We prove that if a subset of a $d$-dimensional vector space over a finite field with $q$ elements has more than $q^{d-1}$ elements, then it determines all the possible directions. If a set has more than $q^k$ elements, it determines a…

We construct a compact nonpositively curved squared 2-complex whose universal cover contains a flat plane that is not the limit of periodic flat planes.

We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph $G(n,p)$. In particular, we show that the k-planar crossing number of $G(n,p)$ is almost surely $\Omega((n^2p)^2)$. Along the…

A celebrated result of Alon and F\"{u}redi gives a tight lower bound on the number of hyperplanes required to cover all points of the Boolean cube $B^n$ except the origin $\bm{0}$. Recent breakthroughs by Sauermann and Wigderson generalized…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Let $H$ be a $k$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\lfloor n/k \rfloor$, then $H$ contains a matching with…

A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…