Papers
Topics
Authors
Recent
Search
2000 character limit reached

Matrix morphology and composition of higher degree forms with applications to diophantine equations

Published 15 May 2020 in math.NT | (2005.07585v1)

Abstract: In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$ being $3,\,4,\,6$ or $8$), and $x_i,\,y_i,\;i=1,\,2,\,\ldots,\,n$, are independent variables while the values of $z_i,\;i=1,\,2,\,\ldots,\,n$, are given by bilinear forms in the variables $x_i,\,y_i$. When $n=2,\,4$ or $8$, we also obtain composition identities $f(x_i)f(y_i)f(z_i)=f(w_i)$ where, as before, $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables while $x_i,\,y_i,z_i,\;i=1,\,2,\,\ldots,\,n$, are independent variables and the values of $w_i,\;i=1,\,2,\,\ldots,\,n$, are given by trilinear forms in the variables $x_i,\,y_i,\,z_i$, and such that the identities cannot be derived from any identities of the type $f(x_i)f(y_i)=f(z_i)$. Further, we describe a method of obtaining both these types of composition identities for forms of higher degrees. The composition identities given in this paper have not been obtained earlier. We also obtain infinitely many solutions in positive integers of certain quartic and octic diophantine equations $f(x_1,\,\ldots,\,x_n)=1$ where $f(x_1,\,\ldots,\,x_n)$ is a form that admits a composition identity and $n=4$ or $8$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.