£104.78

Springer - Patterns in Permutations and Words Book

Name: Springer - Patterns in Permutations and Words Book
Brand: Springer
Price: 104.78 GBP
Availability: InStock

Computer Science

It has never been this cheap. We have no record of a lower price.

£105 today · cheaper than every other day in the last 3 months

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 40 days • 40 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 40 days • 1 price levels

Days at Price

Price Analysis

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

Price range: £105 - £105

Price levels: 1 different prices over 40 days

Description

Explore the evolving field of combinatorics with Patterns in Permutations and Words. Part of the Monographs in Theoretical Computer Science (An EATCS Series), this Springer publication addresses a subject that has seen significant interest in recent years. The text traces the roots of this branch back to the foundational works of Rotem, Rogers, and Knuth from the 1970s. This book provides a detailed look at how patterns in permutations and words serve as a useful language for solving problems across many different areas. Readers can find connections to the theory of Kazhdan-Lusztig polynomials, singularities of Schubert varieties, and interval orders. It also covers applications related to Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms. Whether you are studying theoretical computer science or advanced mathematics, this monograph offers a comprehensive look at how these combinatorial patterns apply to seemingly unrelated problems. It is an essential resource for understanding the mathematical frameworks used in modern computational theory and statistical modeling.

Key Features

Part of the prestigious Monographs in Theoretical Computer Science (An EATCS Series) published by Springer.

Covers a wide range of applications including Kazhdan-Lusztig polynomials and Schubert varieties.

Explores the mathematical connections between permutations and statistical mechanics models.

Provides insights into various sorting algorithms and their relationship to combinatorial patterns.

Traces the historical development of the subject from the foundational works of the 1970s.

Useful for studying interval orders, Chebyshev polynomials, and other complex mathematical structures.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3642173322
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 01 September 2011
Listed Since: 25 October 2010

Barcode

No barcode data available

Springer - Patterns in Permutations and Words Book

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

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)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

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

Applied Combinatorics on Words: 105 (Encyclopedia of Mathematics and its Applications, Series Number 105)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Algorithmic Algebraic Combinatorics and Gröbner Bases

Ultrafilters Across Mathematics (Contemporary Mathematics): International Congress Ultramath 2008: Applications of Ultrafilters and Ultraproducts in Mathematics, June 1-7, 2008, Pisa, Italy

A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

A Path to Combinatorics for Undergraduates: Counting Strategies

Sequences, Groups, and Number Theory (Trends in Mathematics)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

The Mathematics of Paul Erdős II

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

CRC Press Combinatorics and Number Theory of Counting Sequences

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Combinatorics and Graphs (Contemporary Mathematics)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Combinatorics of Compositions and Words (Discrete Mathematics and Its Applications)

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

De Gruyter Combinatorial Designs - Discrete Mathematics Book