The least common multiple of random sets in polynomial rings over finite fields
DOI10.1007/S11139-020-00357-9zbMATH Open1498.11236OpenAlexW3137166509MaRDI QIDQ829634FDOQ829634
Authors: Goran Djankovic
Publication date: 6 May 2021
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-020-00357-9
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
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)
Cites Work
- Gaussian limiting distributions for the number of components in combinatorial structures
- Mod-Poisson convergence in probability and number theory
- The least common multiple of random sets of positive integers
- Ensembles de polynômes irréductibles et théorèmes de densité
- STATISTICS OF PRIME DIVISORS IN FUNCTION FIELDS
Cited In (3)
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)