In this paper, we consider a generalization of Ebenbauer’s differential equation for non-symmetric matrix diagonalization to a flow on arbitrary complex semisimple Lie algebras. The flow is designed in such a way that the desired diagonalizations are precisely the equilibrium points in a given Cartan subalgebra. We characterize the set of all equilibria and establish a Morse-Bott type property ...

A subset of the vertex set of a graph G, S ⊆ V (G), is a (k, τ)-regular set if it induces a k-regular subgraph of G and every vertex not in the subset has τ neighbors in it. This paper is a contribution to the given problem of existence of (k, τ)-regular sets associated with all distinct eigenvalues of integral strongly regular graphs. The minimal idempotents of the Bose-Mesner algebra of stron...

We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, /»„ /»,) sets in PG(£— \,q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples.

We introduce in this paper the concept of left WMC2 rings and concern ourselves with rings containing an injective maximal left ideal. Some known results for left idempotent reflexive rings and left HI rings can be extended to left WMC2 rings. As applications, we are able to give some new characterizations of regular left self-injective rings with nonzero socle and extend some known results on ...

In this paper, we endow set S with the structure of an ordered semigroup and define “intuitionistic fuzzy” analogous for several notions that have been proved to be useful in the theory of ordered semigroups and give some equivalent conditions of these definitions. Then we characterize the completely regular and the strongly regular ordered semigroups by means of intuitionistic fuzzy bi-ideals.

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that the category formed by these decompositions with certain morphisms is equivalent to the category of strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular decomposition. As a consequence, each ideal regular language is the set ...

As the main result of this paper it is proved that an interval matrix [Ac −∆, Ac +∆] is strongly regular if and only if the matrix inequality M(I − |I − RAc| − |R|∆) ≥ I has a solution, where M and R are real square matrices and M is nonnegative. Several consequences of this result are drawn.

In this paper, we construct a new infinite class of two-character sets in PG(5, q2) and determine their automorphism groups. From this construction arise new infinite classes of two-weight codes and strongly regular graphs, and a new distance-2 ovoid of the split Cayley hexagon of order 4.

notions of strongly regular, regular and left(right) regular $gamma$−semigroupsare introduced. equivalent conditions are obtained through fuzzy notion for a$gamma$−semigroup to be either strongly regular or regular or left regular.

A graph is 3-e.c. if for every 3-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \ T. Although almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain...