The least common multiple of random sets in polynomial rings over finite fields
From MaRDI portal
Publication:829634
DOI10.1007/s11139-020-00357-9zbMath1498.11236OpenAlexW3137166509MaRDI QIDQ829634
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
Arithmetic theory of polynomial rings over finite fields (11T55) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Distribution functions associated with additive and positive multiplicative functions (11N60)
Cites Work
- The least common multiple of random sets of positive integers
- Gaussian limiting distributions for the number of components in combinatorial structures
- Mod-Poisson Convergence in Probability and Number Theory
- Ensembles de polynômes irréductibles et théorèmes de densité
- STATISTICS OF PRIME DIVISORS IN FUNCTION FIELDS
This page was built for publication: The least common multiple of random sets in polynomial rings over finite fields
