Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-24T05:10:24.164Z Has data issue: false hasContentIssue false
  • English
  • Français

TOPICS IN DIVISIBILITY: PAIRWISE COPRIMALITY, THE GCD OF SHIFTED SETS AND POLYNOMIAL IRREDUCIBILITY

Part of: Algebraic number theory: global fields Elementary number theory Polynomials and matrices

Published online by Cambridge University Press:  02 January 2016

RANDELL HEYMAN
RANDELL HEYMAN*
Affiliation:
School of Mathematics and Statistics, University of New South Wales, Sydney, New South Wales 2052, Australia email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

divisibilitypairwise coprimalitypolynomial irreducibilitygreatest common divisor of sets

MSC classification

Primary: 11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Secondary: 11C08: Polynomials 11R09: Polynomials (irreducibility, etc.)
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 94 , Issue 1 , August 2016 , pp. 167 - 168
Copyright
© 2016 Australian Mathematical Publishing Association Inc. 

References

Akiyama, S. and Pethő, A., ‘On the distribution of polynomials with bounded roots II. Polynomials with integer coefficients’, Unif. Distrib. Theory 9(1) (2014), 5–19.Google Scholar
Dietmann, R., ‘On the distribution of Galois groups’, Mathematika 58 (2012), 35–44.CrossRefGoogle Scholar
Ding, C., Pei, D. and Salomaa, A., The Chinese Remainder Theorem (World Scientific, Singapore, 1996).CrossRefGoogle Scholar
Gauss, C. F., Disquisitiones Arithmeticae, English edn (Springer, New York, 1986).CrossRefGoogle Scholar
Heyman, R., ‘Pairwise non-coprimality of triples’, Preprint, 2014, arXiv:1309.5578 [math.NT].Google Scholar
Hu, J., ‘Pairwise relative primality of positive integers’, Preprint, 2014, arXiv:1406.3113 [math.NT].Google Scholar
Katz, V. J., A History of Mathematics, brief edn (Pearson/Addison-Wesley, Boston, MA, 2003).Google Scholar
Knuth, D. E., The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, 3rd edn (Addison-Wesley, Boston, MA, 1998).Google Scholar
Lenstra, A. K., Lenstra, H. W. and Lovász, L., ‘Factoring polynomials with rational coefficients’, Math. Ann. 261 (1982), 515–534.CrossRefGoogle Scholar
Moree, P., ‘Counting carefree couples’, Math. News. 24(4) (2014), 103–110.Google Scholar
Zywina, D., ‘Hilbert’s irreducibility theorem and the larger sieve’, Preprint, 2010, arXiv:1011.6465 [math.NT].Google Scholar