Related papers: Perfect Cuboid and Congruent Number Equation Solut…
We present a novel approach to the age-old question of whether perfect cuboids exist. Our approach consists of two new computer search algorithms, arising from the analysis of "perfect plinths" reported by one of us recently, that are much…
We show by finding an explicit parametrization that a 4th degree surface which arises as a necessary condition for the existence of a perfect cuboid is a rational surface, i.e. birationally equivalent over $\mathbb Q$ to a plane.
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Recently it was shown that the Diophantine equations describing such a cuboid…
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…
A rational face cuboid is a cuboid that all of edges, two of three face diagonals and space diagonal have rational lengths. \[ E_{1,s}: y^2=x(x-(2s)^2)(x+(s^2-1)^2) \] for a rational number $s \neq 0, \pm 1$, and define $\tilde{A}$…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
Nobody has discovered any perfect cuboid and there is no formula to deliver all possible Euler bricks. During investigations of famous open problems regarding the perfect cuboid and Euler brick; I have found new important conjectures on…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…
A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…
Central configurations and relative equilibria are an important facet of the study of the $N$-body problem, but become very difficult to rigorously analyze for $N>3$. In this paper we focus on a particular but interesting class of…
Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…
This article discusses two versions of elliptic equations obtained from a system of equations describing a rational cuboid. Analysis of elliptic equations shows that they are equivalent, and that there are rational points on the elliptic…
A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The second cuboid conjecture specifies a subclass of perfect cuboids described by one Diophantine equation…
Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching…
We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube,…
There are parallelepipeds with edge lengths, face diagonal lengths and body diagonal lengths all positive integers. In particular, there is a parallelepiped with edge lengths 271, 106, 103, minor face diagonal lengths 101, 266, 255, major…
We study arithmetic constraints arising from the three faces meeting along the space diagonal of a rectangular cuboid. Using a propagation mechanism along this diagonal, based on the appearance of a minimal odd prime in certain triangular…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…
A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The second cuboid conjecture specifies a subclass of perfect cuboids described by one Diophantine equation…