Related papers: Conical Kakeya and Nikodym Sets in Finite Fields
We show that for any dimension $d\ge3$, one can obtain Wolff's $L^{(d+2)/2}$ bound on Kakeya-Nikodym maximal function in $\mathbb R^d$ for $d\ge3$ without the induction on scales argument. The key ingredient is to reduce to a 2-dimensional…
Let $\mathcal{L}$ be a family of lines and let $\mathcal{P}$ be a family of $k$-planes in $\mathbb{F}^n$ where $\mathbb{F}$ is a field. In our first result we show that the number of joints formed by a $k$-plane in $\mathcal{P}$ together…
In this paper we show that bending a finite volume hyperbolic $d$-manifold $M$ along a totally geodesic hypersurface $\Sigma$ results in a properly convex projective structure on $M$ with finite volume. We also discuss various geometric…
A set of points $N\subseteq \mathbb{F}_q^d$ is a Nikodym set if, for any $x\in \mathbb{F}_q^d$, there is a line $\ell$ through $x$ such that $\ell\setminus\{x\}\subseteq N$. We conjecture that $|N|=q^d-O_d(q^{d/(d-1)})$ and prove it under…
We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…
In this paper,based on the available mathematical works on geometry and topology of hyperbolic manifolds and discrete groups, some results of Freedman et al (hep-th/9804058) are reproduced and broadly generalized. Among many new results the…
According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…
We apply the technique of K\'aroly Bezdek and Daniel Bezdek to study billiard trajectories in convex bodies, when the length is measured with a (possibly asymmetric) norm. We prove a lower bound for the length of the shortest closed…
Previous work has shown that certain leading orders of arbitrary Vassiliev invariants are generically in the algebra of the coefficients of the Alexander-Conway polynomial \cite{KSA}. Here we illustrate this for a large class of examples,…
In 1971, Cunningham proved that every star-shaped Kakeya set $E\subset\mathbb{R}^2$ satisfies $|E| \geq \pi/108$. In this paper, we show that Cunningham's bound is not optimal and can be improved to $|E| \geq \pi/98$.
Let $K$ be a field of characteristic zero over which every diagonal form in sufficiently many variables admits a nontrivial solution. For example, $K$ may be a totally imaginary number field or a finite extension of a $p$-adic field.…
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of Adaricheva and Bolat (2019) and the Polymath REU (2020), continues to investigate representations of convex geometries with small…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…
We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…
We give a variety of uniqueness results for minimal ellipsoids circumscribing and maximal ellipsoids inscribed into a convex body. Uniqueness follows from a convexity or concavity criterion on the function used to measure the size of the…
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…
In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…
We provide a proof of the (well-known) result that the Poincar\'e exponent of a non-elementary Kleinian group is a lower bound for the upper box dimension of the limit set. Our proof only uses elementary hyperbolic and fractal geometry.