ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Symbolic Computation
Volume 37, Issue 6, June 2004, Pages 727-748
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (270 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jsc.2003.11.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier Ltd. All rights reserved.

The computational complexity of rules for the character table of Sn

Dan BernsteinCorresponding Author Contact Information, E-mail The Corresponding Author

Department of Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel

Received 7 April 2003; 
accepted 4 November 2003. 
Available online 14 March 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The Murnaghan–Nakayama rule is the classical formula for computing the character table of Sn. Y. Roichman (Adv. Math. 129 (1997) 25) has recently discovered a rule for the Kazhdan–Lusztig characters of q Hecke algebras of type A, which can also be used for the character table of Sn. For each of the two rules, we give an algorithm for computing entries in the character table of Sn. We then analyze the computational complexity of the two algorithms, and in the case of characters indexed by partitions in the (k,ℓ) hook, compare their complexities to each other. It turns out that the algorithm based on the Murnaghan–Nakayama rule requires far less operations than the other algorithm. We note the algorithms’ complexities’ relation to two enumeration problems of Young diagrams and Young tableaux.

Article Outline

1. Introduction
1.1. Main results
2. The Murnaghan–Nakayama rule
2.1. An algorithm based on the Murnaghan–Nakayama rule
3. Roichman’s rule
3.1. Recursive formulation
3.2. An algorithm based on Roichman’s rule
4. Problem instance complexity
4.1. MurNak
4.2. Roich
5. Comparing the algorithms
5.0. Worst case analysis
5.1. (k,ℓ) hooks
5.2. General diagrams
Acknowledgements
References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.