A regular language of the form UP' M' is called a single loop from the viewpoint of automata theory. It is known that every regular language can be expressed as (U,,,, U,L.;IV, )U F. where .4 is an index set, u,, ~1~ EX\*, c, EX~, i E A, and F is a finite set of words. This expression is called an s
Invariant sectors of the regular representation of loop groups
✍ Scribed by Wang Zheng-Dong
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 201 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0377-9017
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Cayley graph = Cay(G, S) is called a graphical regular representation of the group G if Aut = G. One long-standing open problem about Cayley graphs is to determine which Cayley graphs are graphical regular representations of the corresponding groups. A simple necessary condition for to be a graphi
Let W be a Weyl group and let V be the natural ރW-module, i.e., the reflection representation. For a complex irreducible character of W, we consider the invariant Ý wgW Ž . introduced by N. Kawanaka. We determine I ; q explicitly. Looking over these Ž . results, we observe a relation between Kawa