Counting with Symmetric Functions: 43 (Developments in Mathematics, 43) - Image 1

£71.94

Springer Counting with Symmetric Functions: 43 (Developments in Mathematics, 43)

Name: Counting with Symmetric Functions: 43 (Developments in Mathematics, 43)
Brand: Springer
Price: 71.94 GBP
Availability: InStock

Functional Analysis

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

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

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 72 days · 72 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 72 days • 1 price levels

Days at Price

Price Analysis

Most common price: £72 (72 days, 100.0%)

Price range: £72 - £72

Price levels: 1 different prices over 72 days

Description

This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas. The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólya’s enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties. Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3319236172
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Analysis > Functional Analysis
Domain: Amazon UK
Release Date: 15 December 2015
Listed Since: 22 July 2015

Barcode

No barcode data available

Springer Counting with Symmetric Functions: 43 (Developments in Mathematics, 43)

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

Enumerative Combinatorics: Volume 2 (Cambridge Studies in Advanced Mathematics)

CRC Press Combinatorics and Number Theory of Counting Sequences

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory: An Introduction to Enumeration and Graph Theory (Third Edition)

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (3Rd Edition)

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory (Second Edition)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

CRC Press Combinatorics: Discrete Mathematics and Applications

Algorithmic Probability and Combinatorics (Contemporary Mathematics): Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, ... of British Columbia, Vancouver, Bc, Canada

Enumerative Combinatorics: Volume 2 (Cambridge Studies in Advanced Mathematics)

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory: An Introduction to Enumeration and Graph Theory (Second Edition)

Combinatorics and Number Theory of Counting Sequences (Discrete Mathematics and Its Applications)

Enumerative Combinatorics: 49 (Cambridge Studies in Advanced Mathematics, Series Number 49)

Analytic Combinatorics

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)

Enumerative Combinatorics: Volume 1: 49 (Cambridge Studies in Advanced Mathematics, Series Number 49)

Chapman and Hall/CRC Handbook of Enumerative Combinatorics

CRC Press Handbook of Enumerative Combinatorics - Mathematics

Enumerative Combinatorics (Discrete Mathematics and Its Applications)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

A Path to Combinatorics for Undergraduates: Counting Strategies

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory (4th Edition)