Linearly dependent powers of binary quadratic forms

Research output: Contribution to journalArticlepeer-review

Abstract

Given an integer d ≥ 2, what is the smallest r so that there is a set of binary quadratic formsg (f1,...,fr) for which (fdj) is nontrivially linearly dependent? We show that ifr ≤4, then d ≤5, and for d ≥ 4, construct such a set with r =d/2+2. Many explicit examples are given, along with techniques for producing others.

Original languageEnglish (US)
Pages (from-to)729-755
Number of pages27
JournalPacific Journal of Mathematics
Volume303
Issue number2
DOIs
StatePublished - 2019

Keywords

  • Polynomial identities
  • Super-Fermat problem for forms

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Linearly dependent powers of binary quadratic forms'. Together they form a unique fingerprint.

Cite this