Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userContacting Spheres in Positive Characteristic and Applications
381
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $mathbb{F}_q$ be a finite field of order $q$. Given a set $S$ of oriented spheres in $mathbb{F}_q^d$, how many pairs of spheres can be in contact? In this paper, we provide a sharp result for this question by using discrete Fourier analysis. More precisely, we will show that if the size of $S$ is not too large, then the number of pairs of contacting spheres in $S$ is $O(|S|^{2-varepsilon})$ for some $varepsilon>0$.
rate research
Read More
Let $mathbb{F}_q$ be an arbitrary finite field, and $mathcal{E}$ be a set of points in $mathbb{F}_q^d$. Let $Delta(mathcal{E})$ be the set of distances determined by pairs of points in $mathcal{E}$. By using the Kloosterman sums, Iosevich and Rudnev proved that if $|mathcal{E}|ge 4q^{frac{d+1}{2}}$, then $Delta(mathcal{E})=mathbb{F}_q$. In general, this result is sharp in odd-dimensional spaces over arbitrary finite fields. In this paper, we use the recent point-plane incidence bound due to Rudnev to prove that if $mathcal{E}$ has Cartesian product structure in vector spaces over prime fields, then we can break the exponent $(d+1)/2$, and still cover all distances. We also show that the number of pairs of points in $mathcal{E}$ of any given distance is close to its expected value.
In this paper, we prove an extension theorem for spheres of square radii in $mathbb{F}_q^d$, which improves a result obtained by Iosevich and Koh (2010). Our main tool is a new point-hyperplane incidence bound which will be derived via a cone restriction theorem. We also will study applications on distance problems.
We study restriction of logarithmic Higgs bundles to the boundary divisor and we construct the corresponding nearby-cycles functor in positive characteristic. As applications we prove some strong semipositivity theorems for analogs of complex polarized variations of Hodge structures and their generalizations. This implies, e.g., semipositivity for the relative canonical divisor of a semistable reduction in positive characteristic and it gives some new strong results generalizing semipositivity even for complex varieties.
We extend an observation due to Stong that the distribution of the number of degree $d$ irreducible factors of the characteristic polynomial of a random $n times n$ matrix over a finite field $mathbb{F}_{q}$ converges to the distribution of the number of length $d$ cycles of a random permutation in $S_{n}$, as $q rightarrow infty$, by having any finitely many choices of $d$, say $d_{1}, dots, d_{r}$. This generalized convergence will be used for the following two applications: the distribution of the cokernel of an $n times n$ Haar-random $mathbb{Z}_{p}$-matrix when $p rightarrow infty$ and a matrix version of Landaus theorem that estimates the number of irreducible factors of a random characteristic polynomial for large $n$ when $q rightarrow infty$.
We consider an analog of the problem Veblen formulated in 1928 at the IMC: classify invariant differential operators between natural objects (spaces of either tensor fields, or jets, in modern terms) over a real manifold of any dimension. For unary operators, the problem was solved by Rudakov (no nonscalar operators except the exterior differential); for binary ones, by Grozman (there are no operators of orders higher than 3, operators of order 2 and 3 are, bar an exception in dimension 1, compositions of order 1 operators which, up to dualization and permutation of arguments, form 8 families). In dimension one, Grozman discovered an indecomposable selfdual operator of order 3 that does not exist in higher dimensions. We solve Veblens problem in the 1-dimensional case over the ground field of positive characteristic. In addition to analogs of the Berezin integral (strangely overlooked so far) and binary operators constructed from them, we discovered two more (up to dualization) types of indecomposable operators of however high order: analogs of the Grozman operator and a completely new type of operators.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
