Some classes of irreducible polynomials
Anca Iuliana Bonciocat, Nicolae Ciprian Bonciocat (2006)
Acta Arithmetica
Similarity:
Anca Iuliana Bonciocat, Nicolae Ciprian Bonciocat (2006)
Acta Arithmetica
Similarity:
Ludwig Bröcker (1988)
Manuscripta mathematica
Similarity:
Gaydarov, Petar, Delchev, Konstantin (2015)
Serdica Journal of Computing
Similarity:
Turan’s problem asks what is the maximal distance from a polynomial to the set of all irreducible polynomials over Z. It turns out it is sufficient to consider the problem in the setting of F2. Even though it is conjectured that there exists an absolute constant C such that the distance L(f - g) <= C, the problem remains open. Thus it attracts different approaches, one of which belongs to Lee, Ruskey and Williams, who study what the probability is for a set of polynomials ‘resembling’...
Antonia W. Bluher (2004)
Acta Arithmetica
Similarity:
Meyn, Helmut, Götz, Werner (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Khodakhast Bibak, Igor E. Shparlinski (2011)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.
Henk Hollmann (1986)
Acta Arithmetica
Similarity:
Keijo Väänänen (1977)
Manuscripta mathematica
Similarity:
D. Markovitch (1951)
Matematički Vesnik
Similarity:
L. Hajdu, R. Tijdeman (2003)
Acta Arithmetica
Similarity:
Andrzej Schinzel (1970)
Acta Arithmetica
Similarity:
P. N. Shrivastava (1977)
Publications de l'Institut Mathématique
Similarity: