Let be a primitive strongly regular graph of order . We first define the Generalized Krein parameters of . Next we establish some inequalities on the Generalized Krein parameters of a strongly regular graph and some admissibility conditions over their Krein parameters.
Euclidean Jordan algebras had many applications on various branches of Mathematics, namely on the formalism of quantum mechanics [1], on combinatorics [2, 3, 4, 5, 6, 7], on the developing theory for interior-point methods [8, 9, 10], and on developing applications to statistics [11].
In this work we establish inequalities on the generalized Krein parameters of a strongly regular graph in the context of Euclidean Jordan algebras.
This paper is organized as follows. In the first section, we review the principal results on Euclidean Jordan algebras. In the next section we present the principal concepts on strongly regular graphs necessary for a clear exposition of this paper. In the third section, we describe the generalized Krein parameters of a strongly regular graph, after associating a three dimensional real Euclidean Jordan algebra to it’s adjacency matrix. Finally, in the last section, we establish some inequalities on these generalized Krein parameters, like those presented on inequality Eq. (7) of Theorem 3 and we present some inequalities for some of the Krein parameters of a strongly regular graph, and present an example of a family of strongly regular graphs that permits us to conclude that the upper bound for the Krein parameter of a strongly regular graph established on Eq. (9) is satisfied. Finally we establish some Generalized Krein conditions associated to the regularity of a strongly regular graph like those established on inequalities Eq. (10) and on Eq. (15) of Theorems 4 and 5 respectively.
Some notions on Euclidean Jordan algebras
Good introductions to Euclidean Jordan algebras can be found in the monograph by Faraut and Korányi[12], and in Koecher’s lecture notes [13]. Now, we will present only the principal results needed for a clear understanding of this paper. Throughout this work we assume that a -dimensional real vector space with a bilinear map in is a real Jordan algebra if and , where . We will suppose, from now on that if is a real Jordan algebra, then is finite dimensional and has a unit element denoted by . Let be a n-dimensional real Jordan algebra. Then is power associative, that is an algebra such that for any in the algebra spanned by and is associative. Since is an associative algebra so one defines in the natural way and for any natural number one defines .
The rank of in is the least natural number such that is linearly dependent and we write . Since the rank of is defined as being the natural number . An element in is regular if . Let be a regular element of and . Then, there exist real scalars and such that
where is the zero vector of . Taking into account (1) we conclude that the polynomial
is the minimal polynomial of . When is not regular the minimal polynomial of has a degree less than . The roots of the minimal polynomial of are the eigenvalues of .
Let be a finite dimensional associative real algebra with the bilinear map . We introduce on a structure of Jordan algebra by considering a new product defined by for all and in . The product is called the Jordan product.
A real Euclidean Jordan algebra is a Jordan algebra with an inner product such that , for all and in . Note that the real vector space of real symmetric matrices of order is a real Euclidean Jordan algebra endowed with the Jordan product and the inner product defined by , where trace denotes the usual trace of matrices. The unit element in this case is the identity matrix of order , .
Let be a real Euclidean Jordan algebra with unit element e. An element in is an idempotent if . Two idempotents and are orthogonal if 0. The set of non zero idempotents is a complete system of orthogonal idempotents if the following three conditions hold: , for , , if , and . An idempotent is primitive if it is a nonzero idempotent of and if it can’t be written as a sum of two non-zero idempotents. We say that is a Jordan frame if is a complete system of orthogonal idempotents such that each idempotent is primitive.
.
Let be a matrix of the Euclidean Jordan algebra . If has distinct eigenvalues and then the set is a complete system of orthogonal idempotents of where each idempotent for is the projector on the eigenvector space of associated to the eigenvalue defined by the equality
for . We must say that they are unique, and we have for and where is the Jordan product of matrices, for and we have .
.
Consider the Euclidean Jordan Algebra with the Jordan product and the inner product . Then
is a complete system of orthogonal idempotents of .
First, we must say that for any element we have
So the natural powers of an element of relatively to the product coincides with the natural powers of relatively to the usual product of matrices. We must also say, that where represents the usual product of matrices. So, since and and
and then is a complete system of orthogonal idempotents of . Finally, we must say, that is a Jordan Frame of the Euclidean Jordan algebra where for each such that and all the others entries of the matrix are all null.
.
[12, p. 43]. Let be a real Euclidean Jordan algebra. Then for in there exist unique real numbers all distinct, and a unique complete system of orthogonal idempotents such that
The numbers ’s of Eq. (3) are the eigenvalues of and the decomposition Eq. (3) is the first spectral decomposition of .
.
[12, p. 44]. Let be a real Euclidean Jordan algebra with . Then for each in there exists a Jordan frame and real numbers and such that
The decomposition Eq. (4) is called the second spectral decomposition of .
Results on strongly regular graphs
Along this paper we consider only non-empty, simple and non complete graphs. By simple graphs we mean graphs without loops and parallel edges. Strongly regular graphs were firstly introduced by Bose[14]. Let be a graph of order . We denote its vertices set by and its edge set by . An edge whose endpoints are and is denoted by and, in such case, the vertices and are adjacent or neighbors. The number of vertices of , , is called the order of . If all vertices of have neighbors, then is called a -regular graph. is called a -strongly regular graph if is -regular and any pair of adjacent vertices have common neighbors and any pair of non-adjacent vertices have common adjacent vertices.
Let be a -strongly regular graph. The adjacency matrix of , , is a binary matrix of order such that , if the vertice is adjacent to and otherwise. The adjacency matrix of satisfies the equation , where is the all one matrix of order .
It is well known (see, for instance, [15]) that the eigenvalues of are , and , where and are given by and , (see [15]).
A strongly regular graph is called a primitive if and are connected, otherwise is called imprimitive. A -strongly regular graph is an imprimitive strongly regular graph if and only if or . Since in this paper we only consider non complete strongly regular graphs that are primitive, we then consider only strongly regular graphs such that .
Euclidean Jordan algebra associated to a strongly regular graph
Now, let be the Euclidean Jordan algebra of real Symmetric matrices of order endowed with the Jordan product and with inner product where and are the usual product of matrices and and the usual product and . Let be a -strongly regular graph and be its adjacency matrix with the distinct eigenvalues, namely , and . Herein, and are the positive eigenvalues and is the negative eigenvalue. Now we consider the Euclidean Jordan subalgebra of , spanned by , and the natural powers of . Since has three distinct eigenvalues, then is a three dimensional real Euclidean Jordan algebra with . Let be the unique complete system of orthogonal idempotents of associated to , with and
Let be the set of square matrices of order with real entries. For , in , we denote by the Hadamard product of matrices and and by the Kronecker product of matrices and . Now, we introduce the following compact notation for the Hadamard and the Kronecker powers of the elements of . Let , , , , and be natural numbers such that , and . Then we define
Since the Euclidean Jordan algebra is closed under the Hadamard product and is a basis of , then there exist real numbers and , , such that
We call the parameters and involved on the equalities Eqs (5) and (6), the generalized Krein parameters of the strongly regular graph . Notice that and are precisely the Krein parameters of already introduced. From now on, we suppose that and are natural numbers such that . Since the matrix such that
is an idempotent matrix and is a principal submatrix of then we deduce the inequality Eq. (7) of Theorem 3.
.
Let be a -strongly regular graph such that with three distinct eigenvalues , and . Consider the generalized Krein parameters and as defined in Eq. (6), with ,, , and in , such that , and and . Then
From inequality Eq. (7) of Theorem 3 we conclude that
Making and on the inequality Eq. (8) and noting that we obtain
Finally, let be a -strongly regular graph with for some natural number such that . Then, the Krein parameter of is such that . Therefore the Theorem 3 allowed us to introduce a good upper bound, , for the Krein parameter of a -strongly regular graph.
Generalized Krein conditions associated to a strongly regular graph
In this section we establish Generalized Krein conditions associated to a strongly regular graph, namely we will analyse the parameters and .
.
Let be a -strongly regular graph such that with three distinct eigenvalues , and . Then, if then we conclude that
Proof..
Since then we conclude that
Now, since then from Eq. (11) we obtain the inequality Eq. (12).
Now, expanding the left side of Eq. (12) and after some simplification, and since we obtain the inequality Eq. (13).
∎
.
Let be a -strongly regular graph such that with three distinct eigenvalues , and . If then , if then we conclude that
.
Let be a -strongly regular graph such that with three distinct eigenvalues , and . Then, if then we conclude that
Proof..
Since and we then have the following inequality Eq. (16).
Now, since and after some algebraic manipulation of Eq. (16) we deduce Eq. (17).
Finally, after dividing both sides of Eq. (18) by we obtain the inequality Eq. (19)
And, finally we conclude that . ∎
Conclusions and experimental results
In this section we consider some examples of parameters sets that verify the inequality Eq. (10) or the inequality Eq. (15). In Table 1 we present the parameters sets (400, 114, 8, 42), (625, 192, 20, 76), (650, 177, 8, 63), (650, 472, 357, 304), (900, 290, 37, 120) and (1024, 385, 36, 210). For each set of parameters we present the order, the regularity, the positive eigenvalue the negative eigenvalue and the parameters and defined such that and respectively.
Numerical results
400
114
8
42
2
36
6.4
625
192
20
76
2
58
31.4
650
177
8
63
2
57
34.2
650
472
357
304
56
4
17.4
900
290
37
120
2
85
62
1024
385
36
210
1
175
106
The data presented on Table 1 confirm the results presented on the inequalities Eqs (10) and (15) in Theorems 4 and 5 respectively.
Footnotes
Acknowledgments
Luis Vieira was partially supported by CMUP (UID/MAT/00144/2019), which is funded by FCT with national (MCTES) and European structural funds through the programs FEDER, under the partnership agreement PT2020.
References
1.
JordanP.NeumannJ.V. and WignerE., On an algebraic generalization of the quantum mechanical formalism, Annals of Mathematics35 (1934), 29–64.
2.
VieiraL.A., Binomial Hadamard series and inequalities on the parameters of a strongly regular graph, Applied Mathematics9 (2018), 1055–1071.
3.
CardosoD.M. and VieiraL.A., Euclidean Jordan algebras with strongly regular graphs, Journal of Mathematical Sciences120 (2004), 881–894.
4.
ManoV.M. and VieiraL.A, Admissibility conditions and asymptotic behavior of strongly regular graphs, International Journal of Mathematical Models and Methods in Applied Sciences Methods6 (2011), 1027–1033.
5.
ManoV.M. and VieiraL.A, Alternating Schur series and necessary conditions for the existence of strongly regular graphs, International Journal of Mathematical Models and Methods in Applied Sciences Methods8 (2014), 256–261.
6.
ManoV.M.MartinsE.A and VieiraL.A, On generalized binomial series and strongly regular graphs, Proyecciones Journal of Mathematics4 (2013), 393–408.
7.
VieiraL.A and ManoV.M., Genereralized Krein parameters of a strongly regular, Applied Mathematics6 (2015), 37–45.
8.
CardosoD.M. and VieiraL.A., On the Optimal parameter of a self-concordant barrier over a symmetric cone, European Journal of Operational Research169 (2006), 1148–1157.
9.
FaybusovichL., Linear systems in Jordan algebras and primal dual interior point algorithms, Journal of Computational and Applied Mathematics86 (1997), 149–175.
10.
FaybusovichL., Euclidean Jordan algebras and interior point algorithms, Positivity1 (1997), 331–357.
11.
MassamH. and NeherE., Estimation and testing for lattice conditional independence models on Euclidean Jordan algebras, Annals of Statistics1 (1998), 1051–1082.
12.
FarautJ. and KorányiA., Analysis on symmetric cones, Oxford Sciences Publications, Oxford, 1994.
13.
KoecherM., The minnesota notes on Jordan algebras and their applications, Springer Verlag, Berlin, 1999.
14.
BoseR.C., Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math13 (1963), 384–419.
15.
GodsilC. and RoyleG., Algebraic graph theory, Springer Verlag, New York, 2001.