Related papers: Perfect Cuboid and Congruent Number Equation Solut…
A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity…
A regular truncated pyramid with rectangular bases;consists of two rectangular bases whose centers are orthogonally aligned with respect to the parallel planes containing their bases; and two pairs of congruent isosceles trapezoids(the four…
We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check (CPC). The graphical formulation is based on the diagrammatic tools of the…
A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…
In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…
The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$. According to the Berge-Fulkerson conjecture, $\pi(G)\le5$ for every bridgeless cubic…
A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…
An ill-posed problem of synthesis of the Pierce electrodes for a cylindrical beam with a polygonal cross-section is considered. It is assumed that a beam of charged particles is extracted from a space-charge-limited planar diode and the…
The aim of this paper is to present a new, analytical, method for computing the exact number of relative equilibria in the planar, circular, restricted 4-body problem of celestial mechanics. The new approach allows for a very efficient…
A vertex 2-coloring of a graph is said to be perfect with parameters $(a_{ij})_{i,j=1}^k$ if for every $i,j\in\{1,...,k\}$ every vertex of color $i$ is adjacent with exactly $a_{ij}$ vertices of color $j$. We consider the perfect…
Nonlinear programming is explicitly analyzed via a novel perspective/method and from a bottom-up manner. The philosophy is based on the recent findings on convex quadratic equation (CQE), which help clarify a geometric interpretation that…
We investigate the average number of solutions of certain quadratic congruences. As an application, we establish Manin's conjecture for a cubic surface whose singularity type is A_5+A_1.
A body cuboid is a rectangular parallelepiped with integer edges and integer face diagonals; if its space diagonal is also integer, it is a perfect cuboid, whose existence is a long-standing open problem. We make two contributions to the…
According to the structural balance theory, a signed graph is considered structurally balanced when it can be partitioned into a number of modules such that positive and negative edges are respectively located inside and between the…
A positive integer $A$ is called a congruent number if $A$ is the area of a right-angled triangle with three rational sides. Equivalently, $A$ is a congruent number if and only if the congruent number curve $y^2=x^3-A^2x$ has a rational…
Systems of dyadic cubes are the basic tools of harmonic analysis and geometry, and this notion had been extended to general metric spaces. In this paper, we construct systems of dyadic cubes of complete, doubling, uniformly perfect metric…
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…
From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…
The existence of a perfect odd number is an old open problem of number theory. An Euler's theorem states that if an odd integer $ n $ is perfect, then $ n $ is written as $ n = p ^ rm ^ 2 $, where $ r, m $ are odd numbers, $ p $ is a prime…