Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
The Minimal Polynomials of Unipotent Elements in Irreducible Representations of the Classical Groups in Odd Characteristic
 
I. D. Suprunenko National Academy of Sciences of Belarus, Minsk, Belarus
The Minimal Polynomials of Unipotent Elements in Irreducible Representations of the Classical Groups in Odd Characteristic
eBook ISBN:  978-1-4704-0553-3
Product Code:  MEMO/200/939.E
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $45.60
The Minimal Polynomials of Unipotent Elements in Irreducible Representations of the Classical Groups in Odd Characteristic
Click above image for expanded view
The Minimal Polynomials of Unipotent Elements in Irreducible Representations of the Classical Groups in Odd Characteristic
I. D. Suprunenko National Academy of Sciences of Belarus, Minsk, Belarus
eBook ISBN:  978-1-4704-0553-3
Product Code:  MEMO/200/939.E
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $45.60
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 2002009; 154 pp
    MSC: Primary 20;

    The minimal polynomials of the images of unipotent elements in irreducible rational representations of the classical algebraic groups over fields of odd characteristic are found. These polynomials have the form \((t-1)^d\) and hence are completely determined by their degrees. In positive characteristic the degree of such polynomial cannot exceed the order of a relevant element. It occurs that for each unipotent element the degree of its minimal polynomial in an irreducible representation is equal to the order of this element provided the highest weight of the representation is large enough with respect to the ground field characteristic. On the other hand, classes of unipotent elements for which in every nontrivial representation the degree of the minimal polynomial is equal to the order of the element are indicated.

    In the general case the problem of computing the minimal polynomial of the image of a given element of order \(p^s\) in a fixed irreducible representation of a classical group over a field of characteristic \(p>2\) can be reduced to a similar problem for certain \(s\) unipotent elements and a certain irreducible representation of some semisimple group over the field of complex numbers. For the latter problem an explicit algorithm is given. Results of explicit computations for groups of small ranks are contained in Tables I–XII.

    The article may be regarded as a contribution to the programme of extending the fundamental results of Hall and Higman (1956) on the minimal polynomials from \(p\)-solvable linear groups to semisimple groups.

  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Notation and preliminary facts
    • 3. The general scheme of the proof of the main results
    • 4. $p$-large representations
    • 5. Regular unipotent elements for $n = p^s + b$, $0 < b < p$
    • 6. A special case for $G = B_r(K)$
    • 7. The exceptional cases in Theorem 1.7
    • 8. Theorem 1.9 for regular unipotent elements and groups of types $A$, $B$, and $C$
    • 9. The general case for regular elements
    • 10. Theorem 1.3 for groups of types $A_r$ and $B_r$ and regular elements
    • 11. Proofs of the main theorems
    • 12. Some examples
    • Appendix. Tables
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 2002009; 154 pp
MSC: Primary 20;

The minimal polynomials of the images of unipotent elements in irreducible rational representations of the classical algebraic groups over fields of odd characteristic are found. These polynomials have the form \((t-1)^d\) and hence are completely determined by their degrees. In positive characteristic the degree of such polynomial cannot exceed the order of a relevant element. It occurs that for each unipotent element the degree of its minimal polynomial in an irreducible representation is equal to the order of this element provided the highest weight of the representation is large enough with respect to the ground field characteristic. On the other hand, classes of unipotent elements for which in every nontrivial representation the degree of the minimal polynomial is equal to the order of the element are indicated.

In the general case the problem of computing the minimal polynomial of the image of a given element of order \(p^s\) in a fixed irreducible representation of a classical group over a field of characteristic \(p>2\) can be reduced to a similar problem for certain \(s\) unipotent elements and a certain irreducible representation of some semisimple group over the field of complex numbers. For the latter problem an explicit algorithm is given. Results of explicit computations for groups of small ranks are contained in Tables I–XII.

The article may be regarded as a contribution to the programme of extending the fundamental results of Hall and Higman (1956) on the minimal polynomials from \(p\)-solvable linear groups to semisimple groups.

  • Chapters
  • 1. Introduction
  • 2. Notation and preliminary facts
  • 3. The general scheme of the proof of the main results
  • 4. $p$-large representations
  • 5. Regular unipotent elements for $n = p^s + b$, $0 < b < p$
  • 6. A special case for $G = B_r(K)$
  • 7. The exceptional cases in Theorem 1.7
  • 8. Theorem 1.9 for regular unipotent elements and groups of types $A$, $B$, and $C$
  • 9. The general case for regular elements
  • 10. Theorem 1.3 for groups of types $A_r$ and $B_r$ and regular elements
  • 11. Proofs of the main theorems
  • 12. Some examples
  • Appendix. Tables
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.