1. Introduction
This paper is an extended version of the work “An Euclidean Jordan Algebra of Symmetric Matrices Closed for the Schur Product of Matrices” presented in Congress Circuits, Systems, Communications, and Computers 2023 [
1]. For a good understanding of the theory of Euclidean Jordan algebras we refer to the book Analysis on Symmetric Cones (see [
2]) For a good survey about association schemes we refer to the texts presented in References [
3,
4]. To apply matrix theory to engineering, mathematics, and cryptography, we refer to References [
5,
6]. Several mathematicians and engineers have developed their investigation into several science areas of mathematics, working in the environment of Euclidean Jordan algebras (see, for instance, References [
7,
8,
9]). Euclidean Jordan algebras have also become a good tool for analyzing discrete structures’ eigenvalues like strongly regular graphs (see [
10]). We must also say that other authors extended the properties of the spectrum of a symmetric matrix to simple Euclidean Jordan algebras (see, for example, [
11,
12]). Euclidean Jordan algebras have also become an excellent environment to analyze the spectrum of symmetric association schemes. We now describe the plan of the paper. In
Section 2, we describe the principal concepts of real finite-dimensional Jordan algebras and real finite-dimensional Euclidean Jordan algebras that one needs to understand in the next sections of this paper. In
Section 3, we present a description of some properties of symmetric association schemes and some examples. In
Section 4, we define the Krein parameters of a Euclidean Jordan algebra associated with a symmetric association scheme, and next, we deduce some admissibility conditions over these Krein parameters. In
Section 5, we present some theory about strongly regular graphs. Next, in
Section 6, we define the modified Krein parameters of a strongly regular graph and establish some inequalities over these type parameters. And, we define in this section some new inequalities over the Krein parameters of a strongly regular graph. Finally, in the last section, we present some considerations about the Krein parameters of a symmetric association scheme and of a strongly regular graph.
2. Some Theory about Jordan Algebras and Euclidean Jordan Algebras
Herein, we will describe only the more relevant concepts about the theory of finite-dimensional real Euclidean Jordan algebras that we will use in this paper.
Let us consider a real finite-dimensional vector space equipped with a vector multiplication of vectors Then, is a real Jordan algebra if it is a real commutative algebra such that, for any of its elements a and b, we have where And, for any natural number l, the powers of order l are defined in the following way: where e is the unit element of the vector multiplication of the finite-dimensional real Jordan algebra One says that is a real Euclidean Jordan algebra if is equipped with an inner product such that, for any elements , and z of , we have In the following text of this paper, we will use the abbreviation RFEJA to designate a real finite-dimensional Euclidean Jordan algebra. We are only interested in an RFEJA with a unit, which we will denote always by And, we will use the abbreviation EJA to designate an Euclidean Jordan algebra.
Let us consider an RFEJA equipped with the operation of the multiplication of its vectors ★, the inner product of its vectors , and with the multiplication unit The rank of the element h in is the smallest natural number t such that is a linearly dependent set, and we write Since is an RFEJA, then for any , we have We define An element is an idempotent if . The idempotent h and g are orthogonal if We say that the set of non-null vectors of is a complete system of orthogonal idempotent, and the abbreviation that we will use through will be CSOI, if , for , , if and , and . An idempotent of is primitive if it is a non-zero idempotent of and cannot be written as a sum of two non-zero orthogonal idempotent. A Jordan frame of is a set of non-zero idempotent of such that S is a complete system of orthogonal idempotent, along the text we will use the abbreviation JF to designate it, such that each idempotent is primitive.
Theorem 1. ([
2], p. 43).
Let us consider an RFEJA with the unit . Then, for h in , there exist unique real numbers all distinct, and a unique CSOI such that Decomposition (
1) is called the first spectral decomposition of
Theorem 2. ([
2], p. 44).
Let us consider an RFEJA with unit and such that Then, for each in , there exists an JF and real numbers and such that (2) is verified. Decomposition (
2) is called the second spectral decomposition of
In an RFEJA, all the Jordan frames have the same cardinally as their rank.
3. Some Properties of Symmetric Association Schemes
A symmetric associative scheme with d classes is a finite set provided with relations such that
- 1.
is a partition of
- 2.
;
- 3.
For if , then ;
- 4.
For each
, there exists a real number
such that, for all
in
, we have (
3).
- 5.
The classes of symmetric association schemes can be described through their adjacency matrices , where for d is defined as if and only if and otherwise.
So, the matrices associated to a symmetric association scheme satisfy the following equalities.
- 1.
- 2.
- 3.
- 4.
- 5.
We must note that Property 2 implies that the matrices form a linear independent set of matrices of the vector space formed by real symmetric matrices of order n over the field with the usual operations of addition of matrices and multiplication of a matrix by a scalar.
In the following, we will designate a symmetric association scheme by SAS. We will define an SAS by the matrices s, and we will say consider the SAS
Example 1. Let us consider the SAS , where and The SAS defined by the matrices presented in (4) verifies the multiplication in Table 1. In Table 1 of the SAS , we have that and . Herein, we must say that the algebra spanned by the elements of the SAS is an RFEJA such that and As a consequence, there exists a unique JF, , that is the basis of with Since the algebra is a commutative algebra spanned by symmetric matrices, we can say that this Jordan frame can be obtained by considering a matrix A with distinct eigenvalues of and next determine the projectors on each common proper subspace of A using the equality (5)where the ’s for are the distinct eigenvalues of Remark 1. To obtain a , of the RFEJA, spanned by the matrices of the SAS of the Example 1 and using the notation and , we can write that for , since is a matrix with the distinct eigenvalues , and So, after some calculations, we obtain: Example 2. Let us consider the SAS , where The process of multiplication of the matrices of the SAS is described in Table 2. We have that the projectors on the proper sub-spaces of the matrix that has the eigenvalues and 1 are and the projectors associated with the proper sub-spaces of are: Hence, the JF of the EJA spanned by the SAS is the set such that .
4. Krein Parameters of a Particular Euclidean Jordan Algebra
Let us consider an SAS with d classes, and the real vector space Then, is a real algebra, closed for the Schur product of two of its matrices, when it is equipped with the usual product of real matrices of order n. Now, one proves that is a commutative algebra.
Firstly, we will show that
Indeed, we have
Let
u and
v be two elements of
Let us consider the following notation:
and
Then, we have the following calculations:
So, since is a commutative algebra, the algebra provided with the inner product defined by for any u and v of becomes an RFEJA.
Indeed, since is a commutative, associative algebra, we have the following calculations. , and finally, we conclude that . Next, noting that , we will show that Now, for each matrix A of , we can say that the set is a linearly dependent set of , then Next, we will deduce that .
But, since
is the bais of
formed by commuting symmetric matrices, then they are simultaneously diagonalizable, and therefore, there exists a basis of projectors
on the proper sub-spaces common of all the matrices of the SAS
, of
Now, let us consider the element
with all the
’s distinct. Then, the decomposition (
6) is the first spectral decomposition of
X, and
is the unique CSOI associated with
Now, we will deduce that
is a JF of
But, firstly, we will show that
For that, we show that
Since the set
is linearly independent if and only if the determinant (
7) is a non-null determinant
and since the
’s are all distinct, then the set
is a free set of
Now, since the set
is linearly independent and the set
is linearly dependent set (note that
), then we conclude that
, and therefore,
So, we can say that
is a JF of
since
has cardinality equal to
And, we also must say that since
, then
is the bais of
. Next, we will show that
has a unique JF, this is we will prove that the unique JF of
is
Indeed, if
is another JF of
, then we would obtain
But, since is a CSOI, then X would have two first spectral spectral decomposition’s if Therefore
In what follows, we will define the Krein parameters of
as being the coordinates of
relatively to the basis
of
, where
represents the Schur product of the real square matrices
A and
B with same order, that is, as being the real numbers
for
such that
Next, we will present some inequalities involving the Krein parameters of
Theorem 3. Let us consider the RFEJA spanned by an SAS with d classes with the unique Jordan frame Then, we have for thatfor Proof. We have that
, where
represents the Kronecker product of the matrices
A and
Since the matrix
verifies the equality
, where
O is the null matrix, then we have that if
is an eigenvalue of
Z, and we must have
Since
, where
represent the Schur product of the matrices
A and
B, is a principal sub-matrix of
Z, then we conclude that if
is an eigenvalue of
Y, and we must have
Since each eigenvalue of
is
, then Inequality (
10) follows. □
We must note on a symmetric association scheme with classes considering the unique Jordan frame of the Euclidean Jordan algebra spanned by , we have that the matrix is an idempotent. Next since is a principal matrix of D, by the analysis of the Krein parameters of G and using a similar proof like the one made in Theorem 3, we obtain Theorem 4.
Theorem 4. Let be the RFEJA spanned by an SAS with classes, and considering the unique JF of , , the Krein parameters with with verify Inequality (11). We conclude Theorem 5 by generalizing Theorem 4.
Theorem 5. Let be the RFEJA spanned by an SAS with classes, and considering the unique JF of , , u be a natural number such that , the Krein parameters with with verify the inequality (12). 5. Some Concepts and Properties about Strongly Regular Graphs
R. C, Bose introduced strongly regular graphs in [
13]. In the following, we will present some relevant properties. For a very perceptible text about concepts and the algebraic properties of strongly regular graphs and algebraic properties of the strongly regular graphs, see Algebraic Graph Theory [
14].
The order of a graph is the number of vertexes it has. If a graph has neither parallel edges nor loops, it is called a simple graph.
One defines the eigenvalues of a graph G as the eigenvalues of its adjacency matrix.
If all pairs of distinct vertices of a simple graph are adjacent, then this graph is called a complete graph.
One defines the complement of a simple graph which one denotes by as being a simple graph with the same set of vertexes of G and such that two any of its vertexes are adjacent if and only if they are not adjacent vertexes of In the following text, we only treat non-empty, simple, and non-complete graphs.
The degree of a vertex x of a graph G is the number of incident edges on A graph G is called regular if all its vertexes have the same degree l.
One says that a graph is a strongly regular graph if G is regular graph with order m, and if any pair of adjacent vertexes have c common neighbor vertexes and any pair of non-adjacent vertexes have d common neighbor vertexes.
In the following, the abbreviation srg will be used to designate a strongly regular graph.
If G is a srg,then the complement graph of is a srg.
A srg G is primitive if and only if G and are connected. A srg is a non-primitive srg if and only if or
The adjacency matrix
A of a
strongly regular graph
G satisfies Equation (
13).
The real numbers
and
[
14], where
are the eigenvalues of
The real numbers
and
defined, respectively, by Inequalities (
14) and (
15).
are the multiplicities of the eigenvalues
and
Next, we present the admissibility conditions (
16–
21) over the multiplicities of the eigenvalues and over the eigenvalues and the parameters of a
primitive srg
G.
The admissibility conditions (
16) and (
17) are known as the integrability conditions of a strongly regular graph, and Inequalities (
18) and (
19) are known as the Krein conditions of a strongly regular graph [
15]. And, finally, Inequalities (
20) and (
21) are known as the absolute bounds conditions of a strongly regular graph [
16].
6. Modified Krein Parameters of a Strongly Regular Graph
Let us consider the primitive strongly regular graph
G such that
and with the eigenvalues
and
Next, let us consider the Euclidean Jordan sub-algebra
of the Euclidean Jordan algebra
, equipped with the product of two matrices ★ as being the usual product of matrices and the inner product of two matrices being the
of these two matrices, spanned by the identity matrix of order
m and the natural powers of the matrix of adjacency
of
G. Now, we consider the Jordan frame
of
that is the bais of
, where we have
Now, we define the modified Krein parameters of
G as being the real numbers
with
such that
where
represents the Schur product of the real square matrices
A and
B of order
m. Herein, we must say that
is an idempotent matrices, and their eigenvalues are 0 or 1, and therefore, since
is a principal sub-matrix of
, then we conclude that the eigenvalues of this matrix is greater than 0 and lower than 1. But, we must say that
is an idempotent. Then, we conclude that the eigenvalues of the matrix
are greater than 0 and lower than
And, therefore, we conclude that the modified Krein parameters
verify the inequalities
for
and
Hence, we have established Theorem (6)
Theorem 6. Let us consider a primitive G strongly regular graph Then, the modified Krein parameters of G verify the inequalities:for and Now, we must remember that, in our notation, the Krein parameters of a strongly regular graph are the real numbers such that
Next, we present Theorem 7, which is an application of the Theorem 3 to strongly regular graphs.
Theorem 7. Let G be a primitive strongly regular graph such that . Then, the Krein parameters of G, for and verify the inequality (24). 7. Conclusions
Inequalities (
10) and (
11) presented in Theorems 3 and 4, respectively, over the Krein parameters of the finite-dimensional real Euclidean Jordan algebra spanned by a symmetric association scheme are distinct from those that were established for any symmetric association schemes (see [
4]). We also have introduced modified Krein parameters of a strongly regular graph and have established some inequalities over these modified Krein parameters. Finally, we have established some new admissibility conditions over the Krein parameters of a strongly regular graph. In future work, we will recur to other spectral analysis methods of discrete structures to establish new inequalities over the spectrum of a symmetric association scheme and of a strongly regular graph.