Logo - springer
Slogan - springer

Mathematics - Algebra | Combinatorial Algebra: Syntax and Semantics

Combinatorial Algebra: Syntax and Semantics

Sapir, Mark V.

2014, XVI, 355 p. 66 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$59.99

(net) price for USA

ISBN 978-3-319-08031-4

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$79.99

(net) price for USA

ISBN 978-3-319-08030-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Contains proofs of more than 20 classical and modern results about Burnside properties, growth, finite basis property, automata, amenability, etc
  • The book is self-contained; no prerequisites beyond the standard courses of linear and abstract algebra are required
  • The book emphasizes common ideas and tools used in the proofs of various seemingly quite different theorems

Combinatorial Algebra: Syntax and Semantics provides a comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of  more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about the growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata.

 

With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified audience.  No prerequisites beyond standard courses in linear and abstract algebra are required. The broad appeal of this book extends to a variety of student levels: from advanced high-schoolers to undergraduates and graduate students, including those in search of a Ph.D. thesis who will benefit from the  “Further reading and open problems” sections at the end of Chapters 2 –5.

 

The book can be used in a classroom and for self-study, engaging anyone who wishes to learn and better understand this important area of mathematics.

Content Level » Graduate

Keywords » Burnside-type problems - Novikov–Adian theorem - amenable groups - combinatorics on words - semigroups - symbolic dynamics

Related subjects » Algebra - Mathematics

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Group Theory and Generalizations.