On the degree of the GCD of random polynomials over a finite field

DOI10.1155/2021/3619347zbMath1477.11004OpenAlexW3199287536MaRDI QIDQ2052063

Kui Liu, Meijie Lu

Publication date: 25 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/3619347

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic functions in probabilistic number theory (11K65)

Related Items (1)

Most plane curves over finite fields are not blocking

Cites Work

• On the average value of the least common multiple of \(k\) positive integers
• Roots of random polynomials over a finite field
• Divisibility properties of random samples of integers
• On the probability that \(k\) positive integers are relatively prime
• Arithmetical Functions of a Greatest Common Divisor. I
• On the average number of real roots of a random algebraic equation

This page was built for publication: On the degree of the GCD of random polynomials over a finite field