Combinatorics of set partitions
From MaRDI portal
Recommendations
Cited in
(75)- Partitions of a set satisfying certain set of conditions
- Combinatorial solution of the partition problem for a discrete set
- On the real-rootedness of generalized Touchard polynomials
- Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
- Generalized poly-Cauchy and poly-Bernoulli numbers by using incomplete \(r\)-Stirling numbers
- Interior vertices in set partitions
- Combinatorial aspects of the splitting number
- Restricted \(r\)-Stirling numbers and their combinatorial applications
- A combinatorial approach to the generalized central factorial numbers
- Alphabetic points in restricted growth functions
- Gini index on generalized \(r\)-partitions
- On \(q\)-poly-Bernoulli numbers arising from combinatorial interpretations
- Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
- On colored set partitions of type \(B_n\)
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
- Counting subwords in flattened partitions of sets
- Pattern avoidance in ordered set partitions and words
- Extensions of set partitions and permutations
- The perimeter and site-perimeter of set partitions
- Combinatorics of lopsided sets
- How to grow it? Strategies of mathematical development presented by the example of enumerating certain set partitions
- Combinatorics of integer partitions with prescribed perimeter
- On pattern avoiding flattened set partitions
- scientific article; zbMATH DE number 6683578 (Why is no real title available?)
- Counting subwords in flattened involutions and Kummer functions
- scientific article; zbMATH DE number 5904291 (Why is no real title available?)
- Set partitions and integrable hierarchies
- Pattern avoidance in ordered set partitions
- Partitions of a finite set into structured subsets
- scientific article; zbMATH DE number 1305516 (Why is no real title available?)
- New refined enumerations of set partitions related to sorting
- Counting corners in compositions and set partitions presented as bargraphs
- Nested sets, set partitions and Kirkman-Cayley dissection numbers
- The impact of random models on clustering similarity
- Elements protected by records in set partitions
- Some results on the avoidance of vincular patterns by multisets
- Schröder partitions, Schröder tableaux and weak poset patterns
- Merging-free partitions and run-sorted permutations
- Lattice paths with a first return decomposition constrained by the maximal height of a pattern
- A view from the bridge spanning combinatorics and probability
- Combinatorial analysis of the scheme of dual repeated transfer
- Set partitions and parity successions
- On a generalization of the recurrence defining the number of derangements
- Run distribution over flattened partitions
- The sets of flattened partitions with forbidden patterns
- scientific article; zbMATH DE number 7310228 (Why is no real title available?)
- Counting water cells in bargraphs of compositions and set partitions
- Combinatorics of Compositions and Words
- Enumerations on bargraphs
- Counting set partitions by the number of movable letters
- Counting 1 2 rectangles in set partitions
- Fourier series of sums of products of ordered Bell and poly-Bernoulli functions
- Recurrence relations in counting the pattern 13-2 in flattened permutations
- Hiking a generalized Dyck path: a tractable way of calculating multimode boson evolution operators
- scientific article; zbMATH DE number 6739377 (Why is no real title available?)
- Combinatorics for the dominating and unsplitting numbers
- The twelvefold way, the nonintersecting circles problem, and partitions of multisets
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- On a question of Li concerning an uncounted class of circular permutations
- Counting visible levels in bargraphs and set partitions
- Counting subword patterns in permutations arising as flattened partitions of sets
- Set partition patterns and the dimension index
- Some positivities in Stirling arrays with higher level
- Cartesian product of sets without repeated elements
- MC-finiteness of restricted set partition functions
- Set partitions with colored singleton blocks
- Lexicographic unranking algorithms for the twelvefold way
- Asymptotic normality for the count of distinct entries in uniformly random inversion sequences avoiding 010 and 0211
- Enumeration of non-crossing partitions according to subwords with repeated letters
- Pattern avoidance and Schur-positivity in restricted-growth words of type B
- Gray codes for signed involutions
- Triangular flattened partitions
- Levels, ascents, and descents in restricted-growth words of type B
- Some identities of Bell polynomials
- Combinatorial identities for restricted set partitions
This page was built for publication: Combinatorics of set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650208)
