Related papers: A finite version of the Kakeya problem
We consider the following prescribed scalar curvature problem on $ S^N$ (*)$$\left\{\begin{array}{l} - \Delta_{S^N} u + \frac{N(N-2)}{2} u = \tilde{K} u^{\frac{N+2}{N-2}} {on} S^N, u >0 \end{array}\right. $$ where $ \tilde{K}$ is positive…
Let $G$ be a connected reductive group scheme acting on a spherical scheme $X$. In the case where $G$ is of type $A_n$, Aizenbud and Avni proved the existence of a number $C$ such that the multiplicity $\dim\hom(\rho,\mathbb{C}[X(F)])$ is…
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
In the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…
Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…
Recently, Corvaja and Zannier obtained an extension of the Subspace Theorem with arbitrary homogeneous polynomials of arbitrary degreee instead of linear forms. Their result states that the set of solutions in P^n(K) (K number field) of the…
If S is a smooth compact surface in $\mathbb{R}^{3}$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3$, $\left\|E_S f\right\|_{L^p\left(\mathbb{R}^3\right)}…
We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of…
We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…
Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…
Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…
A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…
Let $Y$ be the complement of a plane quartic curve $D$ defined over a number field. Our main theorem confirms the Lang-Vojta conjecture for $Y$ when $D$ is a generic smooth quartic curve, by showing that its integral points are confined in…
Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…