scholarly journals Unified Characterizations of Minuscule Kac–Moody Representations Built from Colored Posets

10.37236/8821 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Michael C. Strayer

R.M. Green described structural properties that "doubly infinite" colored posets should possess so that they can be used to construct representations of most affine Kac–Moody algebras. These representations are analogs of the minuscule representations of the semisimple Lie algebras, and his posets ("full heaps") are analogs of the finite minuscule posets. Here only simply laced Kac–Moody algebras are considered. Working with their derived subalgebras, we provide a converse to Green's theorem. Smaller collections of colored structural properties are also shown to be necessary and sufficient for such poset-built representations to be produced for smaller subalgebras, especially the "Borel derived" subalgebra. These developments lead to the formulation of unified definitions of finite and infinite colored minuscule and $d$-complete posets. This paper launches a program that seeks to extend the notion of "minuscule representation" to Kac–Moody algebras, and to classify such representations.


10.37236/9807 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Michael Strayer

The $\Gamma$-colored $d$-complete posets correspond to certain Borel representations that are analogous to minuscule representations of semisimple Lie algebras. We classify $\Gamma$-colored $d$-complete posets which specifies the structure of the associated representations. We show that finite $\Gamma$-colored $d$-complete posets are precisely the dominant minuscule heaps of J.R. Stembridge. These heaps are reformulations and extensions of the colored $d$-complete posets of R.A. Proctor. We also show that connected infinite $\Gamma$-colored $d$-complete posets are precisely order filters of the connected full heaps of R.M. Green.





1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.









2003 ◽  
Vol 259 (1) ◽  
pp. 310-311 ◽  
Author(s):  
Walter Borho ◽  
Anthony Joseph


2001 ◽  
pp. 181-202
Author(s):  
Daniel Beltiţă ◽  
Mihai Şabac


2011 ◽  
Vol 18 (4) ◽  
pp. 277-289 ◽  
Author(s):  
Ghulam Sorwar ◽  
Giovanni Barone-Adesi


Sign in / Sign up

Export Citation Format

Share Document