Pedro-José Cazorla García
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pedro-José Cazorla García has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Lucas Villagra Torcomian
Department of Mathematics, Simon Fraser University, Burnaby, Canada
1 shared publication
Latest Publications
- 3 February 2026
- Published by Springer Nature in Research in Number Theory
- Vol. 12 (1) , 13
On the conductor of a family of Frey hyperelliptic curves
- 3 February 2026
- Published by Springer Nature in Research in Number Theory
- Vol. 12 (1) , 13
On the conductor of a family of Frey hyperelliptic curves
- Open Access
- 30 December 2025
- Published by Elsevier in Journal of Number Theory
- Vol. 283, 121-169
On differences of perfect powers and prime powers
- 30 December 2025
- Published by Elsevier in Journal of Number Theory
- Vol. 283, 121-169
Open AccessOn differences of perfect powers and prime powers
- Open Access
On generalised Pythagorean triples over number fields
Generalised Pythagorean triples are integer tuples $(x,y,z)$ satisfying the equation $E_{a,b,c}: ax^2+by^2+cz^2=0$. A significant amount of research has been devoted towards understanding generalised Pythagorean triples and, in particular, we can now determine whether $E_{a,b,c}$ has solutions and find them in a computationally effective manner. In this paper, we consider an extension of generalised Pythagorean triples to number fields $K$. In particular, we survey and extend the existing results over $\mathbb{Q}$ for determining if $E_{a,b,c}$ has solutions over number fields and if so, to find and parameterise them, as well as to find a minimal solution. Throughout the text, we incorporate numerous examples to make our results accessible to all researchers interested in the topic of generalised Pythagorean triples.Open AccessOn generalised Pythagorean triples over number fields
Generalised Pythagorean triples are integer tuples $(x,y,z)$ satisfying the equation $E_{a,b,c}: ax^2+by^2+cz^2=0$. A significant amount of research has been devoted towards understanding generalised Pythagorean triples and, in particular, we can now determine whether $E_{a,b,c}$ has solutions and find them in a computationally effective manner. In this paper, we consider an extension of generalised Pythagorean triples to number fields $K$. In particular, we survey and extend the existing results over $\mathbb{Q}$ for determining if $E_{a,b,c}$ has solutions over number fields and if so, to find and parameterise them, as well as to find a minimal solution. Throughout the text, we incorporate numerous examples to make our results accessible to all researchers interested in the topic of generalised Pythagorean triples. - Open Access
- 29 August 2024
- Published by Wiley in Mathematika
- Vol. 70 (4)
Asymptotic Fermat's last theorem for a family of equations of signature (2,2n,n)$(2, 2n, n)$
In this paper, we study the integer solutions of a family of Fermat‐type equations of signature , . We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant such that if , there are no solutions of the equation. Our methods use the modular method for Diophantine equations, along with level lowering and Galois theory.
- 29 August 2024
- Published by Wiley in Mathematika
- Vol. 70 (4)
Open AccessAsymptotic Fermat's last theorem for a family of equations of signature (2,2n,n)$(2, 2n, n)$
In this paper, we study the integer solutions of a family of Fermat‐type equations of signature , . We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant such that if , there are no solutions of the equation. Our methods use the modular method for Diophantine equations, along with level lowering and Galois theory.
- Open Access
- 23 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (11) , 1642
Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory. Indeed, the classification of the parameters of e-error correcting perfect codes over q-ary alphabets was a very active topic of research in the late 20th century. Consequently, all parameters of perfect e-error-correcting codes were found if , and it was conjectured that no perfect 2-error-correcting codes exist over any q-ary alphabet, where . In the 1970s, this was proved for q a prime power, for and for only seven other values of q. Almost 50 years later, it is surprising to note that there have been no new results in this regard and the classification of 2-error-correcting codes over non-prime power alphabets remains an open problem. In this paper, we use techniques from the resolution of the generalised Ramanujan–Nagell equation and from modern computational number theory to show that perfect 2-error-correcting codes do not exist for 172 new values of q which are not prime powers, substantially increasing the values of q which are now classified. In addition, we prove that, for any fixed value of q, there can be at most finitely many perfect 2-error-correcting codes over an alphabet of size q.- 23 May 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (11) , 1642
Open AccessPerfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory. Indeed, the classification of the parameters of e-error correcting perfect codes over q-ary alphabets was a very active topic of research in the late 20th century. Consequently, all parameters of perfect e-error-correcting codes were found if , and it was conjectured that no perfect 2-error-correcting codes exist over any q-ary alphabet, where . In the 1970s, this was proved for q a prime power, for and for only seven other values of q. Almost 50 years later, it is surprising to note that there have been no new results in this regard and the classification of 2-error-correcting codes over non-prime power alphabets remains an open problem. In this paper, we use techniques from the resolution of the generalised Ramanujan–Nagell equation and from modern computational number theory to show that perfect 2-error-correcting codes do not exist for 172 new values of q which are not prime powers, substantially increasing the values of q which are now classified. In addition, we prove that, for any fixed value of q, there can be at most finitely many perfect 2-error-correcting codes over an alphabet of size q. - Open AccessAsymptotic Fermat's Last Theorem for a family of equations of signature $(2, 2n, n)$In this paper, we study the integer solutions of a family of Fermat-type equations of signature $(2, 2n, n)$, $Cx^2 + q^ky^{2n} = z^n$. We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant $B_{C, q}$ such that if $n > B_{C,q}$, there are no solutions $(x, y, z, n)$ of the equation. Our methods use the modular method for Diophantine equations, along with level lowering and Galois theory.Open AccessAsymptotic Fermat's Last Theorem for a family of equations of signature $(2, 2n, n)$In this paper, we study the integer solutions of a family of Fermat-type equations of signature $(2, 2n, n)$, $Cx^2 + q^ky^{2n} = z^n$. We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant $B_{C, q}$ such that if $n > B_{C,q}$, there are no solutions $(x, y, z, n)$ of the equation. Our methods use the modular method for Diophantine equations, along with level lowering and Galois theory.
- Open Access
On differences of perfect powers and prime powers
Given a prime number $q$ and a squarefree integer $C_1$, we develop a method to explicitly determine the tuples $(y, n, α)$ for which the difference $y^n-q^α$ has squarefree part equal to $C_1$. Our techniques include the combination of the local information provided by Galois representations of Frey-Hellegouarch curves with the effective resolution of Thue-Mahler equations, as well as the use of improved lower bounds for $q-$adic and complex logarithms. As an application of this methodology, we will completely resolve the case when $1 \le C_1 \le 20$ and $ 2 \le q < 25$.Open AccessOn differences of perfect powers and prime powers
Given a prime number $q$ and a squarefree integer $C_1$, we develop a method to explicitly determine the tuples $(y, n, α)$ for which the difference $y^n-q^α$ has squarefree part equal to $C_1$. Our techniques include the combination of the local information provided by Galois representations of Frey-Hellegouarch curves with the effective resolution of Thue-Mahler equations, as well as the use of improved lower bounds for $q-$adic and complex logarithms. As an application of this methodology, we will completely resolve the case when $1 \le C_1 \le 20$ and $ 2 \le q < 25$.