skip to content
Enumerative combinatorics. Volume 1 Preview this item
ClosePreview this item
Checking...

Enumerative combinatorics. Volume 1

Author: Richard P Stanley
Publisher: Cambridge, NY : Cambridge University Press, 2012. ©1997
Series: Cambridge studies in advanced mathematics, 49.
Edition/Format:   Print book : English : Second editionView all editions and formats
Summary:
"Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Richard P Stanley
ISBN: 9781107015425 1107015421 9781107602625 1107602629
OCLC Number: 751736509
Description: xiii, 626 pages : illustrations ; 24 cm.
Contents: What is enumerative combinatorics? --
Sieve methods --
Partially ordered sets --
Rational generating functions.
Series Title: Cambridge studies in advanced mathematics, 49.
Responsibility: Richard P. Stanley.
More information:

Abstract:

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of  Read more...

Reviews

Editorial reviews

Publisher Synopsis

'... sure to become a standard as an introductory graduate text in combinatorics.' Bulletin of the American Mathematical Society '... will engage from start to finish the attention of any Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/751736509> # Enumerative combinatorics. Volume 1
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "751736509" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/4161271988#Topic/mathematics_discrete_mathematics> ; # MATHEMATICS--Discrete Mathematics
    schema:about <http://id.worldcat.org/fast/868970> ; # Combinatorial enumeration problems
    schema:about <http://dewey.info/class/511.62/e23/> ;
    schema:bookEdition "Second edition." ;
    schema:bookFormat bgn:PrintBook ;
    schema:creator <http://viaf.org/viaf/108421410> ; # Richard P. Stanley
    schema:datePublished "2012" ;
    schema:description ""Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets"--"@en ;
    schema:description "What is enumerative combinatorics? -- Sieve methods -- Partially ordered sets -- Rational generating functions."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/4161271988> ;
    schema:image <http://assets.cambridge.org/97811070/15425/cover/9781107015425.jpg> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/4161271988#Series/cambridge_studies_in_advanced_mathematics> ; # Cambridge studies in advanced mathematics ;
    schema:name "Enumerative combinatorics. Volume 1"@en ;
    schema:productID "751736509" ;
    schema:workExample <http://worldcat.org/isbn/9781107602625> ;
    schema:workExample <http://worldcat.org/isbn/9781107015425> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB194381> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/751736509> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/4161271988#Series/cambridge_studies_in_advanced_mathematics> # Cambridge studies in advanced mathematics ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/751736509> ; # Enumerative combinatorics. Volume 1
    schema:name "Cambridge studies in advanced mathematics ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/4161271988#Topic/mathematics_discrete_mathematics> # MATHEMATICS--Discrete Mathematics
    a schema:Intangible ;
    schema:name "MATHEMATICS--Discrete Mathematics"@en ;
    .

<http://id.worldcat.org/fast/868970> # Combinatorial enumeration problems
    a schema:Intangible ;
    schema:name "Combinatorial enumeration problems"@en ;
    .

<http://viaf.org/viaf/108421410> # Richard P. Stanley
    a schema:Person ;
    schema:birthDate "1944" ;
    schema:familyName "Stanley" ;
    schema:givenName "Richard P." ;
    schema:name "Richard P. Stanley" ;
    .

<http://worldcat.org/isbn/9781107015425>
    a schema:ProductModel ;
    schema:isbn "1107015421" ;
    schema:isbn "9781107015425" ;
    .

<http://worldcat.org/isbn/9781107602625>
    a schema:ProductModel ;
    schema:isbn "1107602629" ;
    schema:isbn "9781107602625" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.