Perfect cuboids and multisymmetric polynomials
classification
🧮 math.NT
keywords
cuboidequationsintegerperfecteulermultisymmetricpolynomialsproblem
read the original abstract
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved mathematical problem. The Diophantine equations of a perfect Euler cuboid have an explicit $S_3$ symmetry. In this paper the cuboid equations are factorized with respect to their $S_3$ symmetry in terms of multisymmetric polynomials. Some factor equations are calculated explicitly.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.