$k$th power residue chains of global fields
Su Hu, Yan Li

TL;DR
This paper generalizes Vegh's theorem on $k$th power residue chains, proving that any possible sequence can form such chains modulo infinitely many primes across various global fields, extending the result beyond prime $k$.
Contribution
It extends Vegh's theorem to all positive integers $k$ and to $S$-integer rings of global fields, broadening the scope of $k$th power residue chains.
Findings
Any sequence can be a $k$th power residue chain modulo infinitely many primes.
The result holds for all positive integers $k$, not just primes.
Applicable to $S$-integer rings of global fields, including number and function fields.
Abstract
In 1974, Vegh proved that if is a prime and a positive integer, there is an term permutation chain of th power residue for infinitely many primes [E.Vegh, th power residue chains, J.Number Theory, 9(1977), 179-181]. In fact, his proof showed that is an term permutation chain of th power residue for infinitely many primes. In this paper, we prove that for any "possible" term sequence , there are infinitely many primes making it an term permutation chain of th power residue modulo , where is an arbitrary positive integer [See Theorem 1.2]. From our result, we see that Vegh's theorem holds for any positive integer , not only for prime numbers. In fact, we prove our result in more generality where the integer ring is replaced by any -integer ring of global fields (i.e. algebraic number fields or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Cryptography and Residue Arithmetic
