Skip to content
Register Sign in Wishlist
Sperner Theory

Sperner Theory

£92.00

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: April 1997
  • availability: Available
  • format: Hardback
  • isbn: 9780521452069

£ 92.00
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set? This theorem stimulated the development of a fast growing theory dealing with external problems on finite sets and, more generally, on finite partially ordered sets. This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming, linear algebra, Lie-algebra representations and eigenvalue methods, probability theory, and enumerative combinatorics. Researchers and graduate students in discrete mathematics, optimisation, algebra, probability theory, number theory, and geometry will find many powerful new methods arising from Sperner theory.

    • Presents a modern part of combinatorics and combinatorial optimisation from a unifying point of view
    • A guide for researchers that is also accessible to graduate students
    Read more

    Reviews & endorsements

    'The presentation is very good and the book should be understandable for a non-specialist.' European Mathematical Society

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 1997
    • format: Hardback
    • isbn: 9780521452069
    • length: 432 pages
    • dimensions: 234 x 156 x 24 mm
    • weight: 0.78kg
    • contains: 25 b/w illus. 1 table
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Extremal problems for finite sets
    3. Profile-polytopes
    4. The flow-theoretic approach
    5. Symmetric chain orders
    6. Algebraic methods in Sperner theory
    7. Limit theorems
    8. Macaulay posets.

  • Author

    Konrad Engel, Universität Rostock, Germany

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×