The Diophantine equation f(x) = g(y)
Yuri Bilu, Robert Tichy (2000)
Acta Arithmetica
Similarity:
Yuri Bilu, Robert Tichy (2000)
Acta Arithmetica
Similarity:
Michael Filaseta, Carrie Finch, Charles Nicol (2006)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We answer three reducibility (or irreducibility) questions for -polynomials, those polynomials which have every coefficient either or . The first concerns whether a naturally occurring sequence of reducible polynomials is finite. The second is whether every nonempty finite subset of an infinite set of positive integers can be the set of positive exponents of a reducible -polynomial. The third is the analogous question for exponents of irreducible -polynomials.
T. Pezda (1996)
Colloquium Mathematicae
Similarity:
Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2011)
Formalized Mathematics
Similarity:
In this article, we formalize a set of points on an elliptic curve over GF(p). Elliptic curve cryptography [10], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security.
Volker Ziegler (2007)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Thomas’ conjecture is, given monic polynomials with , then the Thue equation (over the rational integers) has only trivial solutions, provided with effective computable . We consider a function field analogue of Thomas’ conjecture in case of degree . Moreover we find a counterexample to Thomas’ conjecture for .
Aaron Levin (2007)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We study the problem of constructing and enumerating, for any integers , number fields of degree whose ideal class groups have “large" -rank. Our technique relies fundamentally on Hilbert’s irreducibility theorem and results on integral points of bounded degree on curves.