Perron's irreducibility criterion is a sufficient condition for a polynomial to be irreducible in Z [ x ] {\displaystyle \mathbb {Z} [x]} —that is, for...
4 KB (552 words) - 19:35, 8 August 2024
is equivalent to being divisible by u. Cohn's irreducibility criterion Perron's irreducibility criterion Cox (2011). Dorwart (1935). Schönemann (1846)...
25 KB (3,592 words) - 08:27, 14 March 2025
Cohn's irreducibility criterion is a sufficient condition for a polynomial to be irreducible in Z [ x ] {\displaystyle \mathbb {Z} [x]} —that is, for...
5 KB (694 words) - 07:34, 5 April 2025
on continued fractions Die Lehre von den Kettenbrüchen. He introduced Perron's paradox to illustrate the danger of assuming that the solution of an optimization...
6 KB (524 words) - 20:23, 15 February 2025
coefficients Eisenstein's criterion Perron's irreducibility criterion Hilbert's irreducibility theorem Cohn's irreducibility criterion Irreducible component of a...
20 KB (2,852 words) - 00:22, 27 January 2025
Markov chain (redirect from Irreducible Markov chain)
the reversed process is the same as the forward process. Kolmogorov's criterion states that the necessary and sufficient condition for a process to be...
96 KB (12,900 words) - 21:01, 27 April 2025
(number theory) Chowla–Mordell theorem (number theory) Cohn's irreducibility criterion (polynomials) Critical line theorem (number theory) Davenport–Schmidt...
78 KB (6,293 words) - 12:16, 2 May 2025