Skip to main content

Part of the book series: Grundlehren der mathematischen Wissenschaften ((GL,volume 220))

  • 1619 Accesses

Abstract

Let G be a finite group. We denote by Z[G] the set of all formal linear combinations of elements of G with integer coefficients. In Z[G] we define the operations of addition and multiplication in a quite natural way:

$$ \left. \begin{gathered} \mathop{\sum }\limits_{i} {{n}_{i}}{{g}_{i}} + \mathop{\sum }\limits_{i} {{m}_{i}}{{g}_{i}} = \mathop{\sum }\limits_{i} \left( {{{n}_{i}} + {{m}_{i}}} \right){{g}_{i}}, \hfill \\ \mathop{\sum }\limits_{i} {{n}_{i}}{{g}_{i}}\cdot \mathop{\sum }\limits_{j} {{m}_{j}}{{g}_{j}} = \mathop{\sum }\limits_{{i,j}} {{n}_{i}}{{m}_{j}}{{g}_{i}}{{g}_{j}}. \hfill \\ \end{gathered} \right\} $$
((1))

.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kirillov, A.A. (1976). Group Algebras. In: Elements of the Theory of Representations. Grundlehren der mathematischen Wissenschaften, vol 220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66243-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-66243-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-66245-4

  • Online ISBN: 978-3-642-66243-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics