S. Siksek

works on

bernoulli polynomials 1 diophantine equations 1 irreducibility 1 perfect powers 1 quadratic characters 1

From the 1 of 3 linked papers with an AI index.

collaborators

Showing math.NTShow all

3 papers · 1 filter

math.NT2026

On a character-twisted analogue of SchÃ¤ffer's equation

KÃ¡lmÃ¡n GyÃ¶ry, Vandita Patel, Ãkos PintÃ©r +1

The paper proves that for almost all integers m divisible by the conductor of a primitive quadratic character, a character‑twisted sum of k‑th powers cannot equal a perfect power y…

math.NT2024

Efficient resolution of Thue-Mahler equations

Adela Gherga, Samir Siksek

A Thue-Mahler equation is a Diophantine equation of the form $F (X, Y) = a \cdot p_{1}^{z_{1}} \dots p_{v}^{z_{v}}, g cd (X, Y) = 1$ where $F$ be an irreducible homogeneous binary form o…

math.NT2024

Primitive algebraic points on curves

Maleeha Khawaja, Samir Siksek

A number field $K$ is primitive if $K$ and $Q$ are the only subextensions of $K$ . Let $C$ be a curve defined over $Q$ . We call an algebraic point $P\in C(\overlin…