We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms, this improves significantly upon an earlier result of Dey and Thangadurai.
- arithmetic progressions
- binary quadratic forms
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Basic - Fundamental (Grundlagenforschung)