New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique

Full text

Pdf (748 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1996 international symposium on Symbolic and algebraic computation table of contents

Zurich, Switzerland

Pages: 155 - 160

Year of Publication: 1996

ISBN:0-89791-796-0

Authors

Gene Cooperman	College of Computer Science, Northeastern University, Boston, MA
Michael Tselman	College of Computer Science, Northeastern University, Boston, MA

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 9, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/236869.236927 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	Arlazarov, V.L., Dinic, E.A., Kronrod, M.A. and Faxadzev, I.A., (1970). "On Economical Construction of the Transitive Closure of a Directed Graph", Dokl. Nauk SSSR 194, pp. 487-488. English translation in Soviet Math. Dokl. 11:5, pp. 1209-1210.
	3	Gene Cooperman, STAR/MPI: binding a parallel library to interactive symbolic algebra systems, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.126-132, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220363]
	4	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	5	H.W.Gollan and G.O. Michler "Construction of a 45694-dimensional simple module of Lyons' sporadic group over GF(2)", Linear Algebra and Its Applications, preprint.
	6	W. Gropp, E. Lusk and A. Skjellum, Using MPI, MIT Press, 1994.
	7	D.F. Holt and S. Rees, "Testing Modules for Irreducibility", J. Austral. Math. Soc. Ser. A 57, pp. 1-16, 1994,
	8	S. Linton (revised by L. Finkelstein), untitled manuscript describing Parker's condensation technique.
	9	Klaus Lux , Jürgen Müller , Michael Ringe, Peakword condensation and submodule lattices: an application of the meat-axe, Journal of Symbolic Computation, v.17 n.6, p.529-544, June 1994 [doi>10.1006/jsco.1994.1033]
	10	R. Parker, "The computer calculation of modular characters. (The Meat-Axe)", in M. Atkinson (ed.), Computational Group Theory, Academic Press, London, 267- 74, 1984.
	11	A. J. E. Ryba, Computer condensation of modular representations, Journal of Symbolic Computation, v.9 n.5-6, p.591-600, May/June 1990 [doi>10.1016/S0747-7171(08)80076-4]
	12	M. Wiegelmann, Fixpunktkondensation yon Tensorproduktmoduln, Diploma thesis, Dept. of Math., RWTH Aachen, 1994.
	13	Message Passing Interface Forum (author),"MPI: A Message-Passing Interface Standard", International Journal of Supercomputing Applications 8, Number 3/4, 1994.

CITED BY 6

	Gene Cooperman , Henri Casanova , Jim Hayes , Thomas Witzel, Using TOP-C and AMPIC to port large parallel applications to the computational grid, Future Generation Computer Systems, v.19 n.4, p.587-596, May 2003
	Gene Cooperman , Michael Tselman, Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.231-238, June 23-25, 1997, Newport, Rhode Island, United States
	Gene Cooperman , Eric Robinson, Memory-based and disk-based algorithms for very high degree permutation groups, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.66-73, August 03-06, 2003, Philadelphia, PA, USA
	Eric Robinson , Gene Cooperman, A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Eric Robinson , Daniel Kunkle , Gene Cooperman, A comparative analysis of parallel disk-based Methods for enumerating implicit graphs, Proceedings of the 2007 international workshop on Parallel symbolic computation, July 27-28, 2007, London, Ontario, Canada
	Eric Robinson , Jürgen Müller , Gene Cooperman, A disk-based parallel implementation for direct condensation of large permutation modules, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, July 29-August 01, 2007, Waterloo, Ontario, Canada