M
Misha Rudnev
Researcher at University of Bristol
Publications - 75
Citations - 1520
Misha Rudnev is an academic researcher from University of Bristol. The author has contributed to research in topics: Type (model theory) & Incidence (geometry). The author has an hindex of 21, co-authored 71 publications receiving 1299 citations.
Papers
More filters
Journal ArticleDOI
Erdös distance problem in vector spaces over finite fields
Alex Iosevich,Misha Rudnev +1 more
TL;DR: In this article, the authors studied the Erdos/Falconer distance problem in vector spaces over finite fields and developed a Fourier analytic machinery, analogous to that developed by Mattila in the continuous case, for the study of distance sets in order to provide estimates for minimum cardinality of the distance set.
Journal ArticleDOI
On the number of incidences between points and planes in three dimensions
TL;DR: An incidence theorem for points and planes in the projective space �’3 over any Field F, whose characteristic p ≠ 2, is proved.
Journal ArticleDOI
Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdos-Falconer distance conjecture
TL;DR: In this article, a pointwise and average bound for the number of incidences between points and hyperplanes in vector spaces over finite fields has been established, and the Erdos-Falconer distance conjecture does not hold in this setting.
Posted Content
Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdos-Falconer distance conjecture
TL;DR: In this article, a point-wise and average bound for the number of incidences between points and hyperplanes in vector spaces over finite fields was established. But the Erdos-Falconer distance conjecture does not hold in this setting due to the influence of the arithmetic.
Journal ArticleDOI
On new sum-product-type estimates ∗
Sergei Konyagin,Misha Rudnev +1 more
TL;DR: New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given, which improve on the best known ones, including the case of A-subset R, which also due to Solymosi is improved by means of combining the use of the Szemer\'edi-Trotter theorem with an arithmetic combinatorics technique.