𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Combinatorics and Number Theory of Counting Sequences

✍ Scribed by Istvan Mezo (Author)


Publisher
Chapman and Hall/CRC
Year
2019
Leaves
499
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Table of Contents


I Counting sequences related to set partitions and permutations

Set partitions and permutation cycles.

Generating functions

The Bell polynomials

Unimodality, log concavity and log convexity

The Bernoulli and Cauchy numbers

Ordered partitions

Asymptotics and inequalities

II Generalizations of our counting sequences

Prohibiting elements from being together

Avoidance of big substructures

Prohibiting elements from being together

Avoidance of big substructures

Avoidance of small substructures

III Number theoretical properties

Congurences

Congruences vial finite field methods

Diophantic results

Appendix


πŸ“œ SIMILAR VOLUMES


Combinatorics and Number Theory of Count
✍ IstvΓ‘n MezΕ‘ πŸ“‚ Library πŸ“… 2020 πŸ› CRC Press 🌐 English

<strong><em>Combinatorics and Number Theory of Counting Sequences</em></strong>is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.<br /><br />The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book

Combinatorics and Number Theory of Count
✍ Istvan Mezo πŸ“‚ Library πŸ“… 2019 πŸ› Chapman and Hall/CRC 🌐 English

<p><strong><em>Combinatorics and Number Theory of Counting Sequences</em></strong> is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.</p> <p>The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book

Combinatorics, automata, and number theo
✍ ValΓ©rie BerthΓ©, Michel Rigo πŸ“‚ Library πŸ“… 2010 πŸ› CUP 🌐 English

This collaborative volume presents recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important rel

Sequences, Groups, and Number Theory
✍ ValΓ©rie BerthΓ©, Michel Rigo πŸ“‚ Library πŸ“… 2018 πŸ› Springer International Publishing;BirkhΓ€user 🌐 English

<p>This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as c