AbstractLet G be a group with a BN-pair and Γ its Dynkin diagram. Let P be a partially ordered set and λ:P→2Γ be a map from P into the induced subgraphs of Γ. We say that the map λ is transitive if for any a,b,c∈P with a<b<c, each component of λ(b) is contained in either λ(a) or λ(c). Transitive maps characterize the systems of idempotents of certain monoids having G as the group of units. In this paper we construct a universal transitive map, which is then used to describe all transitive maps
summary:We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone ...
AbstractIn this paper it is shown that no finite (undirected) graph can have a faithful, transitive ...
We examine the normal subgroup lattice of 2-transitive automorphism groups A(Ω) of infinite linearly...
AbstractLet G be a group with a BN-pair and Γ its Dynkin diagram. Let P be a partially ordered set a...
Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mu...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractLet W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of se...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
AbstractWe call a partially ordered set Λ sharply transitive if its group of order automorphisms is ...
In this work, S. Abramsky and A. Jung introduced a method to construct a canonical partially orderd ...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
AbstractA reductive monoid is an algebraic monoid with a reductive unit group. Generally, we have th...
In this work, S. Abramsky and A. Jung introduced a method to construct a canonical partially orderd ...
summary:We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone ...
AbstractIn this paper it is shown that no finite (undirected) graph can have a faithful, transitive ...
We examine the normal subgroup lattice of 2-transitive automorphism groups A(Ω) of infinite linearly...
AbstractLet G be a group with a BN-pair and Γ its Dynkin diagram. Let P be a partially ordered set a...
Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mu...
AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to ...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractLet W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of se...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, ant...
AbstractWe call a partially ordered set Λ sharply transitive if its group of order automorphisms is ...
In this work, S. Abramsky and A. Jung introduced a method to construct a canonical partially orderd ...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
AbstractA reductive monoid is an algebraic monoid with a reductive unit group. Generally, we have th...
In this work, S. Abramsky and A. Jung introduced a method to construct a canonical partially orderd ...
summary:We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone ...
AbstractIn this paper it is shown that no finite (undirected) graph can have a faithful, transitive ...
We examine the normal subgroup lattice of 2-transitive automorphism groups A(Ω) of infinite linearly...