The least common multiple of random sets in polynomial rings over finite fields
From MaRDI portal
Publication:829634
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic theory of polynomial rings over finite fields (11T55) Distribution functions associated with additive and positive multiplicative functions (11N60) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)
Recommendations
- Degree distribution of the greatest common divisor of polynomials over 𝔽q
- A probabilistic approach to value sets of polynomials over finite fields
- The least common multiple of random sets of positive integers
- On the degree of the GCD of random polynomials over a finite field
- On the least common multiple of random \(q\)-integers
Cites work
- Ensembles de polynômes irréductibles et théorèmes de densité
- Gaussian limiting distributions for the number of components in combinatorial structures
- Mod-Poisson convergence in probability and number theory
- STATISTICS OF PRIME DIVISORS IN FUNCTION FIELDS
- The least common multiple of random sets of positive integers
Cited in
(7)- Divisibility properties of polynomial expressions of random integers
- On the least common multiple of several random integers
- On the degree of the GCD of random polynomials over a finite field
- The least common multiple of random sets of positive integers
- On the least common multiple of random \(q\)-integers
- On least common multiples of polynomials in \(Z/n Z[x]\)
- Degree distribution of the greatest common divisor of polynomials over 𝔽q
This page was built for publication: The least common multiple of random sets in polynomial rings over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829634)
