Real and finite field versions of Chebotarev's theorem
By: Tarek Emmrich, Stefan Kunis
Potential Business Impact:
Makes computers understand secret codes better.
Chebotarev's theorem on roots of unity states that all minors of the Fourier matrix of prime size are non-vanishing. This result has been rediscovered several times and proved via different techniques. We follow the proof of Evans and Isaacs and generalize the original result to a real version and a version over finite fields. For the latter, we are able to remove an order condition between the characteristic of the field and the size of the matrix as well as decrease a sufficient lower bound on the characteristic by Zhang considerably. Direct applications include a specific real phase retrieval problem as well as a recent result for Riesz bases of exponentials.
Similar Papers
Feasibility of Primality in Bounded Arithmetic
Logic
Proves math rules for faster computer math.
Integral Matrices of Fixed Rank over Number Fields
Number Theory
Finds patterns in math for better computer codes.
Cooley-Tukey FFT over $\mathbb{Q}_p$ via Unramified Cyclotomic Extension
Symbolic Computation
Makes math faster for computers using number tricks.