Skip to main content
Book cover

Algorithmic and Combinatorial Algebra

  • Book
  • © 1994

Overview

Part of the book series: Mathematics and Its Applications (MAIA, volume 255)

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

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

About this book

Even three decades ago, the words 'combinatorial algebra' contrasting, for in­ stance, the words 'combinatorial topology,' were not a common designation for some branch of mathematics. The collocation 'combinatorial group theory' seems to ap­ pear first as the title of the book by A. Karras, W. Magnus, and D. Solitar [182] and, later on, it served as the title of the book by R. C. Lyndon and P. Schupp [247]. Nowadays, specialists do not question the existence of 'combinatorial algebra' as a special algebraic activity. The activity is distinguished not only by its objects of research (that are effectively given to some extent) but also by its methods (ef­ fective to some extent). To be more exact, we could approximately define the term 'combinatorial algebra' for the purposes of this book, as follows: So we call a part of algebra dealing with groups, semi groups , associative algebras, Lie algebras, and other algebraic systems which are given by generators and defining relations {in the first and particular place, free groups, semigroups, algebras, etc. )j a part in which we study universal constructions, viz. free products, lINN-extensions, etc. j and, finally, a part where specific methods such as the Composition Method (in other words, the Diamond Lemma, see [49]) are applied. Surely, the above explanation is far from covering the full scope of the term (compare the prefaces to the books mentioned above).

Authors and Affiliations

  • Institute of Mathematics, Siberian Academy of Sciences, Novosibirsk, Russia

    L. A. Bokut’

  • Department of Mathematics, Omsk University, Omsk, Russia

    G. P. Kukin

Bibliographic Information

  • Book Title: Algorithmic and Combinatorial Algebra

  • Authors: L. A. Bokut’, G. P. Kukin

  • Series Title: Mathematics and Its Applications

  • DOI: https://doi.org/10.1007/978-94-011-2002-9

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: Kluwer Academic Publishers 1994

  • Hardcover ISBN: 978-0-7923-2313-6Published: 31 May 1994

  • Softcover ISBN: 978-94-010-4884-2Published: 21 October 2012

  • eBook ISBN: 978-94-011-2002-9Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XVI, 384

  • Topics: Algebra, Algorithms

Publish with us