arXiv subjects
Publications and source records attributed to Rainer Dietmann.
We consider a finite fields version of the Erdős-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
Let $S_2$ be the set of integer squares. We show that the dimension $d$ of a Hilbert cube $a_0+\{0,a_1\}+...+ \{0, a_d\}\subset S_2$ is bounded by $d=O(\log \log N)$
We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure the distance in the Hamming metric and show that if $p$ is a sufficiently large $r$-bit prime, then for any integer $n \in [1,p]$ one can obtain a primitive root modulo $p$ by changing at most $0.11002786...r$ binary digits of $n$. This is stronger than what can be deduced from the Burgess result. Experimentally, the number of necessary bit changes is very small. We also show that each Hilbert cube contained in the complement of the primitive roots modulo $p$ has dimension at most $O(p^{1/5+ε})$, improving on previous results of this kind.
We show that there are at most $O_{n,ε}(H^{n-2+\sqrt{2}+ε})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973 world record $O_{n}(H^{n-1/2}\log H)$.
Using the Davenport-Heilbronn circle method, we show that for almost all additive Diophantine inequalities of degree $k$ in more than $2k$ variables the expected asymptotic formula for the density of solutions holds true. This appears to be the first metric result on Diophantine inequalities.
Let $G$ be a subgroup of the symmetric group $S_n$, and let $δ_G=|S_n/G|^{-1}$ where $|S_n/G|$ is the index of $G$ in $S_n$. Then there are at most $O_{n, ε}(H^{n-1+δ_G+ε})$ monic integer polynomials of degree $n$ having Galois group $G$ and height not exceeding $H$, so there are only `few' polynomials having `small' Galois group.
Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true. Moreover, our approach shows that almost all such equations having a non-trivial integer solution have a very small such solution, the bound being close to the best possible one.