Michael Bennett

Professor

Relevant Degree Programs

 

Graduate Student Supervision

Doctoral Student Supervision (Jan 2008 - May 2019)
Twisted extensions of Fermat's Last Theorem (2015)

Let x, y, z, n, α ∈ ℤ with α ≥ 1, p and n ≥ 5 primes. In 2011, Michael Bennett, Florian Luca and Jamie Mulholland showed that the equation involving a twisted sum of cubes [equation omitted] has no pairwise coprime nonzero integer solutions p ≥ 5,n ≥ p²p and p ∉ S where S is the set of primes q for which there exists an elliptic curve of conductor NE ∈ {18q,36q,72q} with at least one nontrivial rational 2-torsion point. In this dissertation, I present a solution that extends the result to include a subset of the primes in S; those q ∈ S for which all curves with conductor NE ∈ {18q,36q,72q} with nontrivial rational 2-torsion have discriminants not of the form ℓ² or -3m² with ℓ,m ∈ ℤ. Using a similar approach, I will classify certain integer solutions to the equation of a twisted sum of fifth powers [equation omitted] which in part generalizes work done from Billerey and Dieulefait in 2009. I will also discuss limitations of the methods for these equations and as they extendto further prime exponents.

View record

Thue equations (2014)

In this dissertation, we are mainly interested in effective methods to solveparametrized Thue equations. After briefly talking about the different effective methods, two parametrized families of cubic Thue equations are completelysolved by using Pad é approximation and linear forms in logarithms.The Thue inequality ∣x³ + pxy² + qy³ ∣≤ k,is studied by using Bombieri's method. We find all solutions under some conditions on k, p and q. As an application of Thue equations, we find theintegral points on the Mordell curves Y² = X³ + k for all nonzero integersk with ∣k∣ ≤ 10⁷ . Our approach uses a classical connection between theseequations and cubic Thue equations.

View record

Thue Equations and Related Topics (2008)

No abstract available.

Master's Student Supervision (2010 - 2018)
On a generalization of Waring's conjecture (2013)

Pupyrev's paper "Effectivization of a Lower Bound for

View record

Implementation of a Thue-Mahler equation solver (2011)

A practical algorithm for solving an arbitrary Thue-Mahler equation is presented, and its correctness is proved. Methods of algebraic number theory are used to reduce the problem of solving the Thue-Mahler equation to the problem of solving a finite collection of related Diophatine equations having parameters in an algebraic number field. Bounds on the solutions of these equations are computed by employing the theory of linear forms in logarithms of algebraic numbers. Computational Diophantine approximation techniques based on lattice basis reduction are used to reduce the upper bounds to the point where a direct enumerative search of the solution space becomes possible. Such an enumerative search is carried out with the aid of a sieving procedure to finally determine the complete set of solutions of the Thue-Mahler equation. The algorithm is implemented in full generality as a function in the Magma computer algebra system. This is the first time a completely general algorithm for solving Thue-Mahler equations has been implemented as a computer program.

View record

 

Membership Status

Member of G+PS
View explanation of statuses

Program Affiliations

 

If this is your researcher profile you can log in to the Faculty & Staff portal to update your details and provide recruitment preferences.