Combinatorial methods
Vladimir Shpilrain
Reading Time
at 250 WPM5h 15m
The average reader, reading at a speed of 250 WPM, would take 5h 15m to read Combinatorial methods.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
11
days at 30 min/day
315
total minutes
Combinatorial methods
by Vladimir Shpilrain, Alexander A. Mikhalev, Jie-Tai Yu
Published
2012
Publisher
Springer London, Limited
Pages
315
ISBN-13
9780387217246
Description
The main purpose of this book is to show how ideas from combinatorial group theory have spread to two other areas of mathematics: the theory of Lie algebras and affine algebraic geometry. Some of these ideas, in turn, came to combinatorial group theory from low-dimensional topology in the beginning of the 20th Century. This book is divided into three fairly independent parts. Part I provides a brief exposition of several classical techniques in combinatorial group theory, namely, methods of Nielsen, Whitehead, and Tietze. Part II contains the main focus of the book. Here the authors show how the aforementioned techniques of combinatorial group theory found their way into affine algebraic geometry, a fascinating area of mathematics that studies polynomials and polynomial mappings. Part III illustrates how ideas from combinatorial group theory contributed to the theory of free algebras. The focus here is on Schreier varieties of algebras (a variety of algebras is said to be Schreier if any subalgebra of a free algebra of this variety is free in the same variety of algebras).
Subjects
Classical topology and combinatorial group theory
Handbook of computational group theory
Combinatorial group theory
Topics in combinatorial group theory
Combinatorial group theory
Combinatorial group theory
Frequently Asked Questions
How many pages are in Combinatorial methods?
This edition of Combinatorial methods has approximately 315 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Combinatorial methods?
For most readers, Combinatorial methods typically takes between 6h 34m and 4h 23m to complete. This is based on the book's length of approximately 78,750 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 5h 15m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 11 days • Estimated word count: 78,750 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Combinatorial methods?
The estimated word count for Combinatorial methods is approximately 78,750 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Combinatorial methods?
Combinatorial methods was written by Vladimir Shpilrain, Alexander A. Mikhalev, Jie-Tai Yu.
When was Combinatorial methods published?
The publication date for this specific edition is 2012. The original work may have been published on a different date.