Related papers: Incidence geometry and polynomial expansion over f…
We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We continue to investigate some classes of Szeg\"o type polynomials in several variables. We focus on asymptotic properties of these polynomials and we extend several classical results of G. Szeg\"o to this setting.
We recall several results in Auslander-Reiten theory for finite-dimensional algebras over fields and orders over complete local rings. Then we introduce $n$-cluster tilting subcategories and higher theory of almost split sequences and…
We prove a function field analog of Weyl's classical theorem on equidistribution of polynomial sequences. Our result covers the case in which the degree of the polynomial is greater than or equal to the characteristic of the field, which is…
We present a new family of sharp examples for the Szemer\'edi-Trotter theorem. These are the first examples not based on a rectangular lattice. We also include an application to the discrete inverse Loomis-Whitney problem.
The master theorem, introduced by Richter-Gebert and generalized by Fomin and the first author, provides a method for proving incidence theorems of projective geometry using triangular tilings of surfaces. We investigate which incidence…
We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums, as their parameter varies modulo a prime tending to infinity. Using independence of Kloosterman sheaves, we prove convergence in the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
Using the spectral properties of orthogonal polynomials, we introduce a finite version of quantum field theory for elementary particles. Closed-loop integrals in the Feynman diagrams for computing transition amplitudes are finite.…
Exploiting the equidistribution properties of polynomial sequences, following the methods developed by Leibman ("Pointwise Convergence of ergodic averages for polynomial sequences of translations on a nilmanifold. Ergodic Theory Dynam.…
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
Recent approaches to the problem of inferring a continuous probability distribution from a finite set of data have used a scalar field theory for the form of the prior probability distribution. This letter presents a more general form for…
With the help of hypergeometric functions over finite fields, we study some arithmetic properties of cyclotomic matrices involving characters and binary quadratic forms over finite fields. Also, we confirm some related conjectures posed by…
The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…