Searcharxiv⌕ Search

arXiv subjects

Begum Gulsah Cakti

Publications and source records attributed to Begum Gulsah Cakti.

2 recordsLinked to original sources
arXiv2026

Solving Fermat-type equations over quadratic fields

This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally real versus totally complex number fields. We use these techniques to study the generalized Fermat equation $d^ra^p+b^p+c^p=0$ over quadratic fields $\mathbb{Q}(\sqrt{d})$ of class number one. Extending the results of Freitas\&Siksek and Turcas, we show that when $d=-3,-11,3,5,7,11,13,19,23$, there is an effective and explicit bound, depending on the field $\mathbb{Q}(\sqrt{d})$, such that the latter equation does not have certain types of special solutions. In addition, we obtain effective bounds for $d=-19,-43$, showing that the same equation has no non-trivial solutions of this type. We also discuss, for $d=6,14,21$, the solutions of a variant of the above equation. Our results over imaginary quadratic fields are conjectural. Serre's modularity conjecture and an analogue of Eichler-Shimura over totally complex fields are assumed.

math.NT↗
arXiv2026

Solving equations of signature $(p,p,2)$ with coefficients over number fields

Using the modular method, we study solutions to the Diophantine equation $$Aa^p+Bb^p=Cc^2$$ over number fields. We first prove an asymptotic result for general number fields satisfying an appropriate $S$-unit condition by assuming some standard conjectures in the case of fields that are not totally real. Specifically, we verify that this condition holds for an infinite family of real quadratic fields. Outside the asymptotic setting, we also obtain effective results. In particular, for the equation $$a^p+db^p=c^2$$ over $K= \mathbb{Q}(\sqrt{-d})$ with $d \in \{3, 11, 19, 43, \}$ and $K= \mathbb{Q}(\sqrt d)$ with $d \in \{3, 5, 11, 13, 19, 29\}$, we find explicit bounds (depending on $d$) such that no non-trivial solutions of a certain type exist whenever $p$ exceeds these bounds.

math.NT↗