Combinatorics of Set Partitions
From MaRDI portal
Publication:4650208
DOI10.1201/b12691zbMath1261.05002OpenAlexW1492121749MaRDI QIDQ4650208
Publication date: 26 November 2012
Full work available at URL: https://doi.org/10.1201/b12691
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items (52)
On pattern avoiding flattened set partitions ⋮ On \(q\)-poly-Bernoulli numbers arising from combinatorial interpretations ⋮ Lattice Paths With a First Return Decomposition Constrained by the Maximal Height of a Pattern ⋮ Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems ⋮ A view from the bridge spanning combinatorics and probability ⋮ Set partitions and integrable hierarchies ⋮ On the real-rootedness of generalized Touchard polynomials ⋮ Unnamed Item ⋮ Combinatorial Analysis of the Scheme of Dual Repeated Transfers ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Set partitions and parity successions ⋮ New refined enumerations of set partitions related to sorting ⋮ Set Partition Patterns and the Dimension Index ⋮ Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells ⋮ Pattern avoidance in ordered set partitions and words ⋮ Counting corners in compositions and set partitions presented as bargraphs ⋮ Extensions of set partitions and permutations ⋮ Unnamed Item ⋮ Some identities of Bell polynomials ⋮ The perimeter and site-perimeter of set partitions ⋮ Pattern avoidance in ordered set partitions ⋮ Some positivities in Stirling arrays with higher level ⋮ Generalized poly-Cauchy and poly-Bernoulli numbers by using incomplete \(r\)-Stirling numbers ⋮ Cartesian product of sets without repeated elements ⋮ Counting subwords in flattened involutions and Kummer functions ⋮ Combinatorial identities for restricted set partitions ⋮ Merging-Free Partitions and Run-Sorted Permutations ⋮ On a generalization of the recurrence defining the number of derangements ⋮ Unnamed Item ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ Counting water cells in bargraphs of compositions and set partitions ⋮ Elements protected by records in set partitions ⋮ On colored set partitions of type \(B_n\) ⋮ Fourier series of sums of products of ordered Bell and poly-Bernoulli functions ⋮ Hiking a generalized Dyck path: a tractable way of calculating multimode boson evolution operators ⋮ Restricted \(r\)-Stirling numbers and their combinatorial applications ⋮ The twelvefold way, the nonintersecting circles problem, and partitions of multisets ⋮ Gray codes for signed involutions ⋮ Interior vertices in set partitions ⋮ Run Distribution Over Flattened Partitions ⋮ A combinatorial approach to the generalized central factorial numbers ⋮ The sets of flattened partitions with forbidden patterns ⋮ Counting set partitions by the number of movable letters ⋮ Counting 1 × 2 rectangles in set partitions ⋮ Alphabetic points in restricted growth functions ⋮ Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings ⋮ Gini index on generalized \(r\)-partitions ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Unnamed Item ⋮ Counting visible levels in bargraphs and set partitions ⋮ Counting subword patterns in permutations arising as flattened partitions of sets ⋮ Counting subwords in flattened partitions of sets
This page was built for publication: Combinatorics of Set Partitions
