• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Combinatorial Algebra: Syntax and Semantics

Combinatorial Algebra: Syntax and Semantics

Paperback

Series: Springer Monographs in Mathematics

FictionAlgebraGeneral Mathematics

ISBN10: 3319375903
ISBN13: 9783319375908
Publisher: Springer Nature
Published: Sep 22 2016
Pages: 355
Weight: 1.15
Height: 0.77 Width: 6.14 Depth: 9.21
Language: English

Combinatorial Algebra: Syntax and Semantics provides 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 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.

1 different editions

Also available

Also in

Algebra