Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics) - Image 1

£39.76

Springer Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)

Name: Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)
Brand: Springer
Price: 39.76 GBP
Availability: InStock

Mathematical Logic

This is the most expensive it has ever been. Walk away.

£40 today · previous high £40 · all-time low £40

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 69 days · 69 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 69 days • 1 price levels

Days at Price

Price Analysis

Most common price: £40 (69 days, 100.0%)

Price range: £40 - £40

Price levels: 1 different prices over 69 days

Description

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. 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 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. The book can also be used for self-study, engaging those beyond t he classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3319375903
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 22 September 2016
Listed Since: 08 July 2016

Barcode

No barcode data available

Springer Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Surveys in Combinatorics 2021 (London Mathematical Society Lecture Note Series)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Group Theory, Combinatorics, and Computing (Contemporary Mathematics)

Applications of Group Theory to Combinatorics

Finite Structures with Few Types. (AM–152), Volume 152 (Annals of Mathematics Studies, 152)

Monomial Ideals: 260 (Graduate Texts in Mathematics, 260)

Algebra VI: Combinatorial and Asymptotic Methods of Algebra. Non-Associative Structures: 57 (Encyclopaedia of Mathematical Sciences, 57)

The Mathematics of Paul Erdős II: 2

Mathematics via Problems: Part 3: Combinatorics: 29 (MSRI Mathematical Circles Library)

Cohen-Macaulay Rings 2ed: Revised Edition: 39 (Cambridge Studies in Advanced Mathematics, Series Number 39)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Graph Theory and Its Applications (Textbooks in Mathematics)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Structural Additive Theory: 30 (Developments in Mathematics, 30)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

An Introduction to Quasigroups and Their Representations (Studies in Advanced Mathematics)

Combinatorial Nullstellensatz: With Applications to Graph Colouring (CRC Focus)

Representation Theory and Higher Algebraic K-Theory

Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)

Modern Graph Theory: 184 (Graduate Texts in Mathematics, 184)

Analytic Combinatorics: A Multidimensional Approach (Discrete Mathematics and Its Applications)