{"product_id":"combinatorial-algebra-syntax-and-semantics-paperback","title":"Combinatorial Algebra: Syntax and Semantics - Paperback","description":"\u003cp\u003eby \u003cb\u003eMark V. Sapir\u003c\/b\u003e (Author), \u003cb\u003eVictor S. Guba\u003c\/b\u003e (Contribution by), \u003cb\u003eMikhail V. Volkov\u003c\/b\u003e (Contribution by)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003ci\u003eCombinatorial Algebra: Syntax and Semantics\u003c\/i\u003e 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.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eWith 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 textbook 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.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThe book can also be used for self-study, engaging those beyond t\u003c\/p\u003ehe classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.\u003ch3\u003eBack Jacket\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003ci\u003eCombinatorial Algebra: Syntax and Semantics\u003c\/i\u003e 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.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eWith 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.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eThe book can be used in a classroom and for self-study, engagin\u003c\/p\u003eg anyone who wishes to learn and better understand this important area of mathematics.\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003eMark V. Sapir is a Centennial Professor of Mathematics at Vanderbilt University.\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 355\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.77 x 9.21 x 6.14 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e September 22, 2016\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42105743343751,"sku":"9783319375908","price":89.08,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0601\/2623\/2711\/files\/39c7cd0a47f7d33e32b37de3fa3223ca.webp?v=1732437423","url":"https:\/\/booksby.splitshops.com\/products\/combinatorial-algebra-syntax-and-semantics-paperback","provider":"Books by splitShops","version":"1.0","type":"link"}