Abstract
12.1.1. An admissible automorphism of the graph (\({\bf{I}},H,h \mapsto [h]\)) consists, by definition, of a permutation a : I → I and a permutation a : H → H such that for any h ∈ H, we have [a(h)] = a[h] as subsets of I and such that there is no edge joining two vertices in the same a-orbit.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lusztig, G. (2010). Quivers with Automorphisms. In: Introduction to Quantum Groups. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4717-9_12
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4717-9_12
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4716-2
Online ISBN: 978-0-8176-4717-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)