Function field analogues of Bang-Zsigmondy's theorem and Feit's theorem
From MaRDI portal
Publication:2963315
Abstract: In the number field context, Bang-Zsigmondy's theorem states that for any integers , there exists a prime divisor of such that does not divide for every integer except in some exceptional cases that can be explicitly determined. A prime satisfying the conditions in Bang-Zsigmondy's theorem is called a Zsigmondy prime for . In 1988, Feit introduced the notion of large Zsigmondy primes as follows: A Zsigmondy prime for is called a large Zsigmondy prime if either or divides . In the same year, Feit proved a refinement of Bang-Zsigmondy's theorem which states that for any integers , there exists a large Zsigmondy prime for except in some exceptional cases that can be explicitly determined. In this paper, we introduce notions of Zsigmondy primes and large Zsigmondy primes in the Carlitz module context, and prove function field analogues of Bang-Zsigmondy's theorem and Feit's theorem.
Recommendations
- On the integral divisors of the Carlitz analogue of \(a^n-b^n\)
- On Zsigmondy primes
- On extending Artin's conjecture to composite moduli in function fields
- Carlitz module analogues of Mersenne primes, Wieferich primes, and certain prime elements in cyclotomic function fields
- On Large Zsigmondy Primes
Cited in
(6)- On the integral divisors of the Carlitz analogue of \(a^n-b^n\)
- Primitive prime divisors in backward orbits
- Carlitz module analogues of Mersenne primes, Wieferich primes, and certain prime elements in cyclotomic function fields
- Diophantine approximation and primitive prime divisors in random iterations
- Zsigmondy's theorem and primitive divisors of the Lucas and Lehmer sequences in polynomial rings
- On Large Zsigmondy Primes
This page was built for publication: Function field analogues of Bang-Zsigmondy's theorem and Feit's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963315)