Irreducible polynomial (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Irreducible polynomial" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2books.google.com

3^rd place

3^rd place

2semanticscholar.org

11^th place

8^th place

6^th place

6^th place

low place

8,821^st place

3,479^th place

2,444^th place

69^th place

59^th place

1quantamagazine.org

6,413^th place

4,268^th place

5^th place

5^th place

archive.org

David Dummit; Richard Foote (2004). "ch. 9, Proposition 12". Abstract Algebra. Wiley. p. 309. ISBN 0-471-43334-9.

arxiv.org

Breuillard, Emmanuel; Varjú, Péter P. (2018). "Irreducibility of random polynomials of large degree". Acta Mathematica. 223 (2): 195–249. arXiv:1810.13360. doi:10.4310/ACTA.2019.v223.n2.a1. S2CID 119173838.

books.google.com

Gallian 2012, p. 311 Gallian, Joseph (2012), Contemporary Abstract Algebra (8th ed.), Cengage Learning, ISBN 978-1285402734
Mac Lane & Birkhoff 1999 do not explicitly define "reducible", but they use it in several places. For example: "For the present, we note only that any reducible quadratic or cubic polynomial must have a linear factor." (p. 268). Mac Lane, Saunders; Birkhoff, Garrett (1999), Algebra (3rd ed.), American Mathematical Society, ISBN 9780821816462

doi.org

Chebolu, Sunil; Mináč, Ján (2011). "Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle" (PDF). Mathematics Magazine. 84 (5): 369–371. doi:10.4169/math.mag.84.5.369. Retrieved 2023-04-03.
Breuillard, Emmanuel; Varjú, Péter P. (2018). "Irreducibility of random polynomials of large degree". Acta Mathematica. 223 (2): 195–249. arXiv:1810.13360. doi:10.4310/ACTA.2019.v223.n2.a1. S2CID 119173838.
Fröhlich, A.; Shepherson, J.C. (1955), "On the factorisation of polynomials in a finite number of steps", Mathematische Zeitschrift, 62 (1): 331–4, doi:10.1007/BF01180640, ISSN 0025-5874, S2CID 119955899

maa.org

Chebolu, Sunil; Mináč, Ján (2011). "Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle" (PDF). Mathematics Magazine. 84 (5): 369–371. doi:10.4169/math.mag.84.5.369. Retrieved 2023-04-03.

quantamagazine.org

Hartnett, Kevin (10 December 2018). "In the Universe of Equations, Virtually All Are Prime". Quanta Magazine. Retrieved 2019-01-13.

semanticscholar.org

api.semanticscholar.org

Breuillard, Emmanuel; Varjú, Péter P. (2018). "Irreducibility of random polynomials of large degree". Acta Mathematica. 223 (2): 195–249. arXiv:1810.13360. doi:10.4310/ACTA.2019.v223.n2.a1. S2CID 119173838.
Fröhlich, A.; Shepherson, J.C. (1955), "On the factorisation of polynomials in a finite number of steps", Mathematische Zeitschrift, 62 (1): 331–4, doi:10.1007/BF01180640, ISSN 0025-5874, S2CID 119955899

toronto.edu

math.toronto.edu

Jacobson, Nathan (1985). "4.13 Finite Fields". Basic Algebra I (PDF). New York: W. H. Freeman and Company. ISBN 0-7167-1480-9.

worldcat.org

search.worldcat.org

Fröhlich, A.; Shepherson, J.C. (1955), "On the factorisation of polynomials in a finite number of steps", Mathematische Zeitschrift, 62 (1): 331–4, doi:10.1007/BF01180640, ISSN 0025-5874, S2CID 119955899