Searcharxiv⌕ Search

arXiv subjects

Amalia Pizarro-Madariaga

Publications and source records attributed to Amalia Pizarro-Madariaga.

7 recordsLinked to original sources

Factorization patterns and fields of definition of $\ell$-torsion points on the Jacobians of genus 3 hyperelliptic curves

Motivated by Schoof-Pila-type point-counting algorithms, we study the fields of definition and factorization patterns of Galois orbits of $\ell$-torsion points on the Jacobians of genus-3 hyperelliptic curves over finite fields. We show that the degree of the field of definition of the $\ell$-torsion points can be bounded by $O(\ell^4)$, improving the previously expected $O(\ell^6)$ bound (which reflects the size of the $\ell$-torsion subgroup, of order $\ell^6$ for a genus 3 Jacobian). Moreover, we establish a precise correspondence between the rank of the $\ell$-torsion subgroup and the Galois orbits of $\ell$-torsion divisors. Our approach relies on a detailed analysis of the Jordan decomposition of the Frobenius action on $J$ and its nilpotent part.

math.NT↗

Trinomials, singular moduli and Riffaut's conjecture

Riffaut (2019) conjectured that a singular modulus of degree $h\ge 3$ cannot be a root of a trinomial with rational coefficients. We show that this conjecture follows from the GRH, and obtain partial unconditional results.

math.NT↗

On a divisibility relation for Lucas sequences

In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.

math.NT↗

CM-Points on Straight Lines

We prove that, with "obvious" exceptions, a CM-point (j(τ),j(τ')) cannot belong to a straight line in C^2 defined over Q. This generalizes a result of Kühne, who proved this for the line x+y=1.

math.NT↗

On shifted primes with large prime factors and their products

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set of positive integers n up to x with exactly k prime factors, counted with or without multiplicity, such that the largest prime factor of gcd(p-1 : p | n) exceeds n^{1/2k}.

math.NT↗