A biquadratic Diophantine equation associated with perfect cuboids
arXiv:1207.4081
Abstract
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids are described by a system of four Diophantine equation possessing a natural symmetry. Recently these equations were factorized with respect to this symmetry and the factor equations were derived. In the present paper the factor equations are transformed to -form and then reduced to a single biquadratic equation.
AmSTeX, 17 pages, amsppt style
References in corpus (8)
- A note on the first cuboid conjecture
- Perfect cuboids and irreducible polynomials
- A note on a perfect Euler cuboid
- A note on the second cuboid conjecture. Part I
- A note on the third cuboid conjecture. Part I
- On an ideal of multisymmetric polynomials associated with perfect cuboids
- Perfect cuboids and multisymmetric polynomials
- On the equivalence of cuboid equations and their factor equations
Cited by in corpus (13)
- A general rational solution of an equation associated with perfect cuboids
- Inverse problems associated with perfect cuboids
- On singularities of the inverse problems associated with perfect cuboids
- A note on rational and elliptic curves associated with the cuboid factor equations
- On two algebraic parametrizations for rational solutions of the cuboid equations
- On two elliptic curves associated with perfect cuboids
- A note on solutions of the cuboid factor equations
- A strategy of numeric search for perfect cuboids in the case of the second cuboid conjecture
- Asymptotic estimates for roots of the cuboid characteristic equation in the linear region
- Reverse asymptotic estimates for roots of the cuboid characteristic equation in the case of the second cuboid conjecture
- A note on invertible quadratic transformations of the real plane
- On a pair of cubic equations associated with perfect cuboids
- A fast modulo primes algorithm for searching perfect cuboids and its implementation