1. Introduction
There are several purposes of the current work: to present the Johnson–Tzitzeica theorem and related (open) problems, to relate the Johnson–Tzitzeica theorem to graph theory, and to point out possible applications of the Johnson–Tzitzeica theorem in integrable systems and in the Yang–Baxter equation theory. Historical aspects are also considered.
According to [
1], a set of Johnson circles refers to three circles of equal radius and a common point of intersection. In the Johnson–Tzitzeica theorem, “the figure is so simple (especially as it can be drawn and the theorem verified with a coin or other circular object) that it seems almost out of the question that the fact can have escaped detection. Even if geometers have overlooked it, someone must have noticed it in casually drawing circles. But if this were the case, it seems a theorem of sufficient interest to receive some prominence in the literature, and therefore ought to be well known” (cf. [
2]).
In the next section, we present the Johnson–Tzitzeica theorem. A general symmetric scheme is derived, some open problems proposed, and a new theorem proven. There exists a whole field of discrete integrable geometry, where concepts from elementary geometry to nonlinear continuum or discrete systems of equations are studied. The most similar ideas can be found in a series of papers by A. Doliwa, where the elementary incidence geometry is a source of interesting (usually generic) problems in the theory of completely integrable systems. The paper [
3] on circular lattices and then Desargues maps entered into the scene, leading to several steps to the Yang–Baxter equations through integrable systems and the famous Hirota–Miwa equations (see, for example, the papers [
4,
5,
6]).
In
Section 1, we associate a graph diagram with the Johnson–Tzitzeica theorem. This point of view eventually leads to new results both in geometry and in graph theory.
Section 4 is a gentle introduction to the Yang–Baxter equation (see, for example, [
7,
8,
9,
10,
11,
12]). This equation has certain symmetries, which are used in finding solutions for it, and it plays an important role in integrable systems. V. Drinfeld (see [
13]) suggested considering “set-theoretical” solutions to the Yang–Baxter equation (see also [
14,
15]). We first restrict our attention to the set-theoretical solutions. We recall that graph diagrams are important in the proof of a theorem and in visualizing some results. We present the Yang–Baxter equation in the vectorial space framework, proposing other similar equations. The relationship among these equations are studied using a graph diagram. Notice that the method presented in in the beginning of this section could be applied for finding solutions to them. The last section presents some historical aspects related to the Tzitzeica–Johnson theorem, several remarks (on integrable systems), and some research problems.
2. The Tzitzeica–Johnson Theorem and Pictorial Mathematics
In a talk at the 12th International Workshop on Differential Geometry and Its Applications, UPG Ploiesti 2015, Florin Caragiu explained that there exists a special mathematical discourse, called “proofs without words”. This discourse uses pictures or diagrams in order to boost the intuition of the reader (see [
16,
17]). The pictorial (diagrammatic) style of mathematical language is much appreciated by both educators and researchers in mathematics. Being very easy to grasp, some pictorial-style problems are similar to some nuts being small, but for which we need an entire “artillery” in order to crack them.
We now consider the Tzitzeica–Johnson problem (see, for example, [
18]).
Let
,
, and
be three circles of radius
r. Let us suppose that
, and
. Then, there exists a circle of radius
through
A,
B, and
C (see
Figure 1).
The above theorem can be included in a more general scheme (see
Figure 2).
One could include in this scheme the inclusion–exclusion principle, for three sets:
.
Let, for example, the case be as follows: , , and . Then, there exists a set T, with that contains elements from all possible (sub)sets.
One could better visualize the relationship between the inclusion–exclusion principle and the mathematical scheme from
Figure 2, if we represent the elements of the sets
, and
T as circular lattice points.
Notice that Tzitzeica–Johnson’s theorem has many generalizations [
18] and interpretations related to the above mathematical scheme (from
Figure 2).
The dual Desargues theorem can be interpreted in the light of the above scheme by using arrangements of (three) colored lines.
The hypothesis is as follows:
The conclusion is as follows:
There exists a triple through , and .
Tzitzeica–Johnson’s theorem can be interpreted in terms of disks:
– “If three disks of the same radius have a common point of intersection, then they contain inside of their union a forth disk with the same radius.”;
– “If three disks , and of the same radius have a common point, then there exists a forth disk of the same radius which includes .”
It is an open problem to prove a similar statement for a domain bounded by an arbitrary closed convex curve. In other words, we conjecture that if we consider a domain bounded by an arbitrary closed convex curve and two copies of , denoted by and , such that , then there exists another copy of , denoted by , such that .
Even the case when is a square is very difficult.
We now propose a new construction for a set of Johnson circles (in
Figure 3).
At this moment, we can present a new theorem.
For a set of Johnson circles, let R be the intersection point between the tangent in O to the third circle and the line , Q the intersection point between the tangent in O to the second circle and the line , and P the intersection point between the tangent in O to the first circle and the line .
Then,
P,
Q, and
R are collinear points (see
Figure 4 below).
Proof. The proof of the above theorem is based on the properties of the power of a circle and on Desargues’ theorem. It is the limit case from
Figure 5. □
It is an open problem to find the relationship between the line through P, Q, and R and the circle through A, B, and C.
4. Yang–Baxter Equations, Relations, and Graphs
If X is a set, let be a function, and .
Using the above notation, the set-theoretical Yang–Baxter equation reads:
We use the following notation for a relation R on the set X: we denote by the opposite relation of R; we denote by the complementary relation of R.
(D. Hobby and F. F. Nichita [
19]) Let
X be a set and
a reflexive relation on
X. We define the function
by
Then,
S satisfies (
1) if and only if
is an equivalence relation and
is a strict partial order relation on each class of
.
The proof from [
19] relies heavily on graph diagrams. After many cases are investigated, the theorem is proven. An example using Hasse diagrams and graphs is then presented.
For each of the relations represented by the graphs from
Figure 6 and
Figure 7, if we consider
(S for the complementary relation), we obtain a solution for (
1).
We continue the section working over a generic field k. The tensor products are defined over k. Let V be a vector space over k. Let be the identity map of the space V. We denote by the twist map defined by . For , a k-linear map, let In a similar manner, we denote by a linear map acting on the first and third component of . It turns out that .
A Yang–Baxter operator is a
k-linear map
, which satisfies the braid condition (the Yang–Baxter equation):
Usually, we also require that the map R be invertible.
An important observation is that if
R satisfies (
2), then both
and
satisfy the quantum Yang–Baxter equation (QYBE):
We now consider other (systems of) equations for a
k-linear map
:
(i) If a
k-map
verifies (
4) and (
5), then
R is a common solution for (
2) and (
3);
(ii) If a
k-map
verifies (
2) or (
3), then
R is a solution for (
7);
(iii) If a
k-map
verifies (
2) or (
3), then it is a solution for (
8);
(iv) If a
k-map
verifies (
2), (
3) and (
9), then it is a solution for (
6);
(v) If a
k-map
verifies (
7) and (
9), then it is a solution for (
10).
Proof. (i) We only sketch the proof of the first claim:
, etc (see [
12]).
(ii) The proof is direct;
(iii) For
and
, this equation becomes Equation (
3). For
and
, this equation becomes Equation (
3);
(iv) ;
(v) The proof is direct. □
We could present the above results using a graph diagram (see
Figure 11).