Skip to main content Accessibility help
×
Home

Matching simple modules of condensation algebras

  • Felix Noeske (a1)

Abstract

We revise the matching algorithm of Noeske (LMS J. Comput. Math. 11 (2008) 213–222) and introduce a new approach via composition series to expedite the calculations. Furthermore, we show how the matching algorithm may be applied in the more general and frequently occurring setting that we are only given subalgebras of the condensed algebras which each contain the separable algebra of one of their Wedderburn–Malcev decompositions.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Matching simple modules of condensation algebras
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Matching simple modules of condensation algebras
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Matching simple modules of condensation algebras
      Available formats
      ×

Copyright

References

Hide All
[1]Curtis, C. W. and Reiner, I., ‘Representation theory of finite groups and associative algebras’, Pure and Applied Mathematics, vol. XI (Interscience Publishers, a division of John Wiley & Sons, New York, London, 1962).
[2]Hiss, G., Müller, J., Noeske, F. and Thackray, J., ‘The Brauer characters of the sporadic simple Harada–Norton group and its automorphism group in characteristics 2 and 3’, LMS J. Comput. Math. 15 (2012) 257280.
[3]Holt, D. F., Eick, B. and O’Brien, E. A., Handbook of computational group theory, Discrete Mathematics and its Applications (Chapman & Hall/CRC, Boca Raton, FL, 2005).
[4]Lux, K., ‘Algorithmic methods in modular representation theory’. http://math.arizona.edu/∼klux/habil.dvi.gz, 1997.
[5]Lux, K., Müller, J. and Ringe, M., ‘Peakword condensation and submodule lattices: an application of the MEAT-AXE’, J. Symbolic Comput. 17 (1994) no. 6, 529544.
[6]Lux, K., Neunhöffer, M. and Noeske, F., ‘Condensation of homomorphism spaces’, LMS J. Comput. Math. 15 (2012) 140157.
[7]Lux, K. and Wiegelmann, M., ‘Condensing tensor product modules’, The atlas of finite groups: ten years on (Birmingham, 1995), London Mathematical Society Lecture Note Series 249 (Cambridge University Press, Cambridge, 1998) 174190.
[8]Lux, K. and Wiegelmann, M., ‘Determination of socle series using the condensation method’, J. Symbolic Comput. 31 (2001) no. 1–2, 163178; Computational algebra and number theory (Milwaukee, WI, 1996).
[9] The modular atlas hompage. http://www.math.rwth-aachen.de/∼MOC/ .
[10]Noeske, F., ‘Tackling the generation problem in condensation’, J. Algebra 309 (2007) no. 2, 711722.
[11]Noeske, F., ‘Matching simple modules of condensed algebras’, LMS J. Comput. Math. 11 (2008) 213222.
[12]Ryba, A. J. E., ‘Computer condensation of modular representations’, J. Symbolic Comput. 9 (1990) no. 5–6, 591600; Computational group theory, Part 1.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

Matching simple modules of condensation algebras

  • Felix Noeske (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed