This article is available for purchase or by subscription. See below.
Abstract
|
Given an integer
,
what is the smallest
so that there is a set of binary quadratic forms
for
which
is nontrivially linearly dependent? We show that if
, then
, and for
, construct such
a set with
.
Many explicit examples are given, along with techniques for producing others.
|
PDF Access Denied
We have not been able to recognize your IP address
18.216.32.116
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
polynomial identities, super-Fermat problem for forms
|
Mathematical Subject Classification 2010
Primary: 11E76, 11P05, 14M99
Secondary: 11D25, 11D41
|
Milestones
Received: 18 April 2019
Revised: 27 June 2019
Accepted: 27 June 2019
Published: 4 January 2020
|
|