On the Colored and the Set-Theoretical Yang–Baxter Equations

: This paper is related to several articles published in AXIOMS, SCI, etc. The main concepts of the current paper are the colored Yang–Baxter equation and the set-theoretical Yang–Baxter equation. The Euler formula, colagebra structures, and means play an important role in our study. We show that some new solutions for a certain system of equations lead to colored Yang–Baxter operators, which are related to an Euler formula for matrices, and the set-theoretical solutions to the Yang–Baxter equation are related to means. A new coalgebra is obtained and studied.


Introduction
After the apparition of the quantum Yang-Baxter equation in theoretical physics ( [1]) and statistical mechanics ( [2,3]), it also became important in quantum groups, knot theory, the quantization of integrable non-linear evolution systems, etc. (see, for example, [4][5][6][7]). However, it is "generally believed that the Yang-Baxter equation is a fundamental mathematical structure that will have even more relevance in future developments" (cf. [8]). The focus of the current paper is on various types of Yang-Baxter equations, and its origins are in an unpublished preprint and a series of short articles. The parameter-dependent Yang-Baxter equations are very important in mathematical physics, and, in this paper, we will adapt some constructions of solutions for them for solving for the braid condition.
In the next section, we present the colored Yang-Baxter equation. We propose the problem of finding algorithms for solving the system of Equations (5)- (9). Solutions for that system will lead to new solutions for a spectral-dependent Yang-Baxter equation. We present a new family of solutions for that system, and we hope that other solutions will be found by computational methods. Section 3 surveys recent results (see [9]) on classical means inequalities, and it presents new inequalities and interpretations. In Section 4, we explain that the new colored Yang-Baxter operator (10) is related to the Euler formula. Furthermore, by employing previous techniques, we obtain new solutions for the braid condition: the operators R 1 , R 2 , R 3 , and R 4 .
In 1992, Drinfeld formulated a number of problems in quantum group theory. He suggested considering "set-theoretical" solutions to the quantum Yang-Baxter equation. This problem attracts many beautiful minds, and the progress in solving it is significant (see [10][11][12][13][14]). Reference [12] studies the Yang-Baxter and pentagon equations applicable in mathematical physics. The objective of this research consists of studying how the solutions of the pentagon equation are a useful approach for obtaining new solutions of the Yang-Baxter equation. We will recall the terminology and some results for the set-theoretical Yang-Baxter equation. One can interpret the set-theoretical Yang-Baxter equation as a condition that unifies the equivalence relations and the order relations. Means are also related to the set-theoretical Yang-Baxter equation. Some of the above ideas lead to other new constructions related to Euler's formula. In Section 6, this investigation leads to a new coalgebra structure. Some of its properties are highlighted. A short discussion on Artificial Intelligence and computational methods concludes our paper.

The Colored Yang-Baxter Equation
We will work over a field k, and the tensor products are defined over k. For V, a k-space, we denote by τ : V ⊗ V → V ⊗ V the twist map defined by τ(v ⊗ w) = w ⊗ v, and by I : V → V the identity map of the space V. The following terminology will be used, when we refer to various versions of Yang-Baxter equations. If R : Now, R is a Yang-Baxter operator if it satisfies the equation The simplest examples of Yang-Baxter operators are τ : V ⊗ V → V ⊗ V and its slight generalizations. (ii) Using computational methods, the invertible solutions for (2) in Dimension 2 were classified in [15]. (iii) For dimensions greater than 2, the problem of classifying the Yang-Baxter operators is an unsolved problem.
We now consider an associative algebra A over k, α, β, γ ∈ k, and the k-linear map: Theorem 1 (Dȃscȃlescu and Nichita [4]). With the above notation, if dim A ≥ 2, then R A α,β,γ is a Yang-Baxter operator if and only if one of the following holds: There are many versions of the Yang-Baxter equation. We will consider the unification of a one-parameter-dependent Yang-Baxter equation and a two-parameter-dependent Yang-Baxter equation, which is sometimes called the "colored Yang-Baxter equation" (see, also, [6]).
We define a colored Yang-Baxter operator as a function According to our previous terminology, there exist three operators acting on a triple tensor product V ⊗ V ⊗ V: , and R 13 (x, u, w) (an operator acting non-trivially on the first and third factors in R is a colored Yang-Baxter operator if it satisfies the equation: for all x, y ∈ k, u, v, w ∈ X. We want to apply our method for finding solutions for Equation (3). Let X be (a subset of) the ground field k, and V = A, an associative k-algebra. We will construct a solution to Equation (3) from the associativity of the product in A. So, we are looking for solutions to Equation (3) of the following form where Inserting this ansatz into Equation (3), we obtained the following system of equations (whose solutions produce colored Yang-Baxter operators): Remark 3. (i) If we consider the system of Equations (5)-(9), one simplification is to require that α x , β x , and γ x do not depend on x, u, and v. So, we denote them α, β, and γ. Letting γ be an arbitrary constant, and a ∈ k, one verifies that setting α = aγ and β = γ gives a solution. Similarly, letting γ, b ∈ k be arbitrary, setting α = γ and β = bγ gives a solution.
(ii) The following is a new family of solutions for the system of Equations (5)- (9): Here, a is an arbitrary element of the field k. We do need that k is closed under exponentiation, but this is true for R and C, which are the fields we are mainly interested in.
We can organize the results from this section as a theorem. Theorem 2. Under the above assumptions, there exists the following family of solutions for Equation (3): Proof. We will only check that α x (u, v) = p(a x u − v), β x (u, v) = q(a x u − v), and γ x (u, v) = pa x u − qv are solutions for Equation (5).

Unification Results
We will review and enhance a collection of recent results (see [9]) on unification theories in order to relate them to the previous section.
We consider the following generalization of the above function m(α). The following are examples of inequalities from [9], for a > 0, b > 0: Of course, one can translate the above inequalities in terms of relations of the above function O(x, y).

The next inequalities are new:
Theorem 4. The following inequalities hold for positive real numbers: Proof. The first inequality follows from algebraic manipulations: 2 The last inequality follows from the convexity of the Remark 7. We consider new operations on R: The first operation is some kind of exponentiation (in particular, a • a = 2 √ a+1 − 1 ). The last operation "generates" the addition: a * a = a + 2 , a * a * a * a = a + 4 . The above theorem can be stated as:

Remark 8.
It is an open problem to generalize the above inequalities. Possible generalizations might be the following inequalities: log 3 (3

Generalized Euler Formula
It is useful to identify linear applications with matrices in the current section. Additionally, the exponential function of a matrix is thought as the Taylor expansion of the real exponential function evaluated at the given matrix. The ring of all n × n-matrices over the field k is denoted by M n (k). I will be the identity matrix in M 4 (k), and I will be the identity matrix in M 2 (k).
Moreover, the functions c and s have the following properties:  then e zJ = cos(z)I + sin(z)J, which is a solution for (13).
In this case, two interesting solutions for the braid condition (1) can be obtained. We consider the operator R = aI + bJ, with a, b ∈ C and J the above matrix. The braid condition is satisfied by R if a 2 = −b 2 . The following two main cases are of interest:  then e zJ = cosh(z)I + sinh(z)J ; this is also a solution for (13).
In this case, two other interesting solutions for the braid condition (1), can be obtained. In a similar way with Case (ii), we consider the operator R = aI + bJ, with a, b ∈ C and J our matrix. The braid condition is satisfied by R if a 2 = b 2 . The following two main cases are of interest: Remark 10. Operator (10) has the form (14). More precisely, we start with We take u = v, a = e, p = 1, and q = −1. After simplifications, we obtain an operator of the form R (x) = I + Jx = e xJ .
If we choose the algebra k[X] X 2 −aX−b , we can express R (x) as a matrix:

The Set-Theoretical Yang-Baxter Equation
If X is a set, let S : X × X → X × X be a function, S 12 = S × I and S 23 = I × S. Definition 2. Using the above notation, the set-theoretical Yang-Baxter equation reads: Definition 3. We are using the following notation for a relation R on the set X: we denote by R op the opposite relation of R, and we denote byR the complementary relation of R. Let Theorem 7 (Hobby and Nichita [16]). We consider a reflexive relation R ⊂ X × X on the set X. If we define the function S = S R : u); otherwise, then, S satisfies (15) if and only if R ∪ R op is an equivalence relation, andR is a strict partial order relation on each class of R ∪ R op .
Note that the definition of S R in the above theorem makes sense for any relation R, and that S R only depends on R ∩∆.
The last part of the theorem follows from the property H A = G 2 This paper is related to several articles published in AXIOMS and SCI, where examples of unification constructions in mathematics are presented, or poetical approaches are proposed. Unifying mathematical structures is not always an easy task, and this guiding principle has subtle rules. So, there exists a universal unifying principle both in mathematics and in poetry.
Some of our Yang-Baxter operators are related to quantum gates. Quantum computers are gaining more interest nowadays, as they are very powerful. Artificial Intelligence as we understand it today, was born during the summer of 1956 (at Dartmouth College). The Romanian history of informatics (see [24]) could also be traced back around that period. Thanks to a summer grant at the Targu Mures Computer Center in 1987 (for studying informatics on HC 85, using Basic language), we implemented that technology in education.