null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Combinatorics and Number Theory of Counting Sequences

List Price: $65.99
SKU:
9781032475356
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Istvan Mezo
    Format:
    Paperback
    Pages:
    498
    Publisher:
    CRC Press (January 21, 2023)
    Language:
    English
    ISBN-13:
    9781032475356
    Weight:
    28.25oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260116060413094-20260116.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $65.99
    Series:
    Discrete Mathematics and Its Applications
    Case Pack:
    30
    As low as:
    $62.69
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Country of Origin:
    United States
    Pub Discount:
    30
    Imprint:
    Chapman and Hall/CRC
  • Overview

    Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.



    The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics.



    In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too.



    Features







    • The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems.






    • An extensive bibliography and tables at the end make the book usable as a standard reference.






    • Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.