Related papers: A Reduction for the Distinct Distances Problem in …
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…
We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…
This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).
We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.
Representation theory of $p$-adic groups naturally comes in the study of automorphic forms and one way to understand representations of a group is by restricting to its nice subgroups. D. Prasad studied the restriction for pairs $({\rm…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
It is proved that the set of geodesic circles in two dimensions may be given a variational description and the explicit form of it is presented. In the limit case of the Euclidean geometry a certain claim of uniqueness of such description…
Techniques are presented for calculating directly the scalar functional determinant on the Euclidean d-ball. General formulae are given for Dirichlet and Robin boundary conditions. The method involves a large mass asymptotic limit which is…
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…
A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…
We initiate the study of quadratic discrepancy for finite point sets on the Heisenberg group $\mathbb H^n$ with respect to upper Ahlfors regular probability measures. For a natural family of test sets given by left translations and…
In this work we introduce a category of discrete Lagrange--Poincare systems LP_d and study some of its properties. In particular, we show that the discrete mechanical systems and the discrete mechanical systems obtained by the Lagrangian…
We revisit the classical Unit Distance Problem posed by Erd\H{o}s in 1946. While the upper bound of $O(n^{4/3})$ established by Spencer, Szemer'edi, and Trotter (1984) is tight for systems of pseudo-circles, it fails to account for the…
We study the dual variants of the Erd\H{o}s's distinct distances and unit distance problems. Instead of considering distances determined by points, we consider simplex volumes determined by hyperplanes. We investigate: (1) the maximum…
NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…
We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that…
We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…
We improve the range of exponents for the restriction problem for the 3-d paraboloid over finite fields. The key new ingredient is a variant of the Bourgain-Katz-Tao finite field incidence theorem derived from sum-product estimates. In…