On the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) over finite fields (Q5941623): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/ffta.2000.0292 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058078347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orders of Gauss periods in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248054 / rank
 
Normal rank

Latest revision as of 18:28, 3 June 2024

scientific article; zbMATH DE number 1635871
Language Label Description Also known as
English
On the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) over finite fields
scientific article; zbMATH DE number 1635871

    Statements

    On the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) over finite fields (English)
    0 references
    20 August 2001
    0 references
    Let \(F_q\) be the finite field of order \(q\). The multiplicative order ord\((\gamma)\) of a nonzero element \(\gamma\) of \(F_q\) is the smallest positive integer \(t\) with \(\gamma^t=1\). The author shows that the multiplicative orders of \(\gamma\) and \(\gamma+\gamma^{-1}\) are independent in the following sense: For any \(\varepsilon>0\), sufficiently large \(q\), and any positive divisors \(n\) and \(m\) of \(q-1\) with \(nm\geq q^{3/2+\varepsilon}\) there exists a nonzero element \(\gamma\) of \(F_q\) with ord\((\gamma)=n\) and ord\((\gamma+\gamma^{-1})=m\). The proof is based on bounds on character sums.
    0 references
    finite fields
    0 references
    multiplicative order
    0 references
    character sums
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references