On some subgroups of the multiplicative group of finite rings (Q558195): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharper \(ABC\)-based bounds for congruent polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters and Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial factorisation and an application to regular directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality testing with Gaussian periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic properties of Bell numbers to a composite modulus I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobians of curves over finite fields / rank
 
Normal rank

Latest revision as of 13:13, 10 June 2024

scientific article
Language Label Description Also known as
English
On some subgroups of the multiplicative group of finite rings
scientific article

    Statements

    On some subgroups of the multiplicative group of finite rings (English)
    0 references
    0 references
    30 June 2005
    0 references
    Let \(S\) be a subset of the finite field \(\mathbb F_q\) of \(q\) elements and \(h\) a polynomial over \(\mathbb F_q\) of degree at least \(2\) with no roots in \(S\). The author proves several lower bounds on the size of the group \(G\) generated by the image of \(\{x-s:s \in S \}\) in the group of units of the ring \(\mathbb F_q[X]/(h)\). These bounds are needed in the analysis of the running time of the recent polynomial time primality testing algorithm of \textit{M. Agrawal, N. Kayal} and \textit{N. Saxena} [``PRIMES is in \(P\)''. Ann. Math. (2) 160, No. 2, 781--793 (2004; Zbl 1071.11070)].
    0 references
    0 references
    polynomial rings
    0 references
    linear polynomials
    0 references
    primality testing
    0 references
    0 references