Javascript must be enabled to continue!
Idempotent systems
View through CrossRef
In this paper we introduce the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. We focus on a family of idempotent systems, said to be symmetric. A symmetric idempotent system is an abstraction of the primary module for the subconstituent algebra of a symmetric association scheme. We describe the symmetric idempotent systems in detail. We also consider a class of symmetric idempotent systems, said to be
P
-polynomial and
Q
-polynomial. In the topic of orthogonal polynomials there is an object called a Leonard system. We show that a Leonard system is essentially the same thing as a symmetric idempotent system that is
P
-polynomial and
Q
-polynomial.
Title: Idempotent systems
Description:
In this paper we introduce the notion of an idempotent system.
This linear algebraic object is motivated by the structure of an association scheme.
We focus on a family of idempotent systems, said to be symmetric.
A symmetric idempotent system is an abstraction of the primary module for the subconstituent algebra of a symmetric association scheme.
We describe the symmetric idempotent systems in detail.
We also consider a class of symmetric idempotent systems, said to be
P
-polynomial and
Q
-polynomial.
In the topic of orthogonal polynomials there is an object called a Leonard system.
We show that a Leonard system is essentially the same thing as a symmetric idempotent system that is
P
-polynomial and
Q
-polynomial.
Related Results
Idempotent Factorizations of Square-free Integers
Idempotent Factorizations of Square-free Integers
We explore the class of positive integers n that admit idempotent factorizations n=pq such
that lambda(n) divides (p-1)(q-1), where lambda(n) is the Carmichael lambda function. Id...
FUNCTORS AND SPACES IN IDEMPOTENT MATHEMATICS
FUNCTORS AND SPACES IN IDEMPOTENT MATHEMATICS
Idempotent mathematics is a branch of mathematics in which idempotent operations (for example, max) on the set of reals play a central role. In recent decades, we have seen intensi...
Weak idempotent rings
Weak idempotent rings
In this paper is to introduce the notion of weak idempotent rings as a generalization of Boolean like rings. We obtain many formal properties of the class of weak idempotent rings...
Combinatorics of the Free Baxter Algebra
Combinatorics of the Free Baxter Algebra
We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo. We provide an alter...
Vertex and region colorings of planar idempotent divisor graphs of commutative rings.
Vertex and region colorings of planar idempotent divisor graphs of commutative rings.
The idempotent divisor graph of a commutative ring R is a graph with vertices set in R* = R-{0}, and any distinct vertices x and y are adjacent if and only if x.y = e, for some non...
Orthodox ordered semigroups
Orthodox ordered semigroups
Abstract
An element
e
of an ordered semigroup
...
RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
Let (X, F) be a pair consisting of a finite set X and a set F of transformations of X, and, let <F> and F(l) denote, respectively, the semigroup generated by F and the part o...
A Structural Investigation of the Idempotent Graph Associated with the Ring Zpq
A Structural Investigation of the Idempotent Graph Associated with the Ring Zpq
This study investigates the structural characteristics of the idempotent graph G_Id (R) associated with a commutative ring R. The graph is defined as a simple, undirected graph in ...

