scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

partitions permutations algorithms enumeration partially ordered sets exercises bijections programs listing Involutions constructive combinatorics undergraduate level

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Total orders (06A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Software, source code, etc. for problems pertaining to combinatorics (05-04) Enumerative combinatorics (05Axx)

Related Items

Counting occurrences of subword patterns in non-crossing partitions, Renormalization of two—terminal reliability, Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST), Equivariant log-concavity of graph matchings, Catalan numbers revisited, Skew diagrams and ordered trees, Counting set partitions by the number of movable letters, Counting 1 × 2 rectangles in set partitions, Average cost of Duval's algorithm for generating Lyndon words, The cyclic sieving phenomenon, Duality of graded graphs, Interpolating set partition statistics, \(\sigma\)-restricted growth functions and \(p,q\)-Stirling numbers, Listing graphs that satisfy first-order sentences, Generalization of Dyson's rank and non-Rogers-Ramanujan partitions, Arborescences of covering graphs, Schensted algorithms for dual graded graphs, Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem, Determinant: Old algorithms, new insights, Off-line algorithms for the list update problem, The representation theory of the Temperley-Lieb algebras, Faster combinatorial algorithms for determinant and Pfaffian, A bijection between Proctor's and Sundaram's odd orthogonal tableaux, Finding parity difference by involutions, A new way of counting \(n^ m\), Positive Sum Systems, Set partitions and parity successions, New refined enumerations of set partitions related to sorting, Ears of triangulations and Catalan numbers, Finitely constrained classes of homogeneous directed graphs, Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms, Probabilistic divide-and-conquer: deterministic second half, Counting corners in compositions and set partitions presented as bargraphs, Isols and maximal intersecting classes, Recursive statistics on words, Free rises, restricted partitions, and \(q\)-Fibonacci polynomials, Bijective enumeration of 3-factorizations of an \(N\)-cycle, Some enumerative results related to ascent sequences, Counting and computing the Rand and block distances of pairs of set partitions, The odd-even invariant and Hamiltonian circuits in tope graphs, The perimeter and site-perimeter of set partitions, Stanley decompositions and Hilbert depth in the Koszul complex, Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions, Tiling bijections between paths and Brauer diagrams, A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number, Lattice path matroids: Enumerative aspects and Tutte polynomials, Integrals over Grassmannians and random permutations., Catalan numbers and pattern restricted set partitions, Efficient generation of restricted growth words, Linear Bandwidth Naccache-Stern Encryption, Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, Dual-antiprisms and partitions of powers of 2 into powers of 2, A bijective proof of Jackson's formula for the number of factorizations of a cycle, Combinatorial proofs of inverse relations and log-concavity for Bessel numbers, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Counting water cells in bargraphs of compositions and set partitions, Classical partition functions and the \(U(n+1)\) Rogers-Selberg identity, Identities of Rothe-Abel-Schläfli-Hurwitz-type, Factorial characters of the classical Lie groups, Lattice path enumeration by formal schema, The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability, Acyclic sets of linear orders via the Bruhat orders, Block-connected set partitions, Restricted partitions and \(q\)-Pell numbers, A unified combinatorial approach for \(q\)- (and \(p,q\)-) Stirling numbers, Skew Dyck paths, Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets, The complexity of Euler's integer partition theorem, Generating functions for plane partitions of a given shape, Algorithmic combinatorics based on slicing posets, Baxter algebras and Hopf algebras, Dyck paths of knight moves, Expansions of Chromatic Polynomials and Log-Concavity, Raney and Catalan, Interior vertices in set partitions, Buses, Bullies, and Bijections, Lattice path proof of the ribbon determinant formula for Schur functions, On Erdős–Ko–Rado for Random Hypergraphs II, The signed permutation group on Feynman graphs, Generalized Dyck paths, RNA secondary structure, permutations, and statistics, Unnamed Item, The Gram determinant of the type B Temperley-Lieb algebra, Some combinatorial problems associated with products of conjugacy classes of the symmetric group, Ordered trees with prescribed root degrees, node degrees, and branch lengths, Visibility in non-crossing and non-nesting partitions, Gray codes, loopless algorithm and partitions, From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns, Building uniformly random subtrees, The coolest way to generate combinations, Multipoint correlation functions at phase separation. Exact results from field theory, A direct bijection for the Harer-Zagier formula, Some conditional correlation inequalities for percolation and related processes, Generalized triangulations and diagonal-free subsets of stack polyominoes, A combinatorial interpretation of the inverse \(t\)-Kostka matrix., Generalized rook polynomials, Dyck path enumeration, Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees, The strong Hall property and symmetric chain orders, Efficient linear-time ranking and unranking of derangements, Trace identities from identities for determinants, New classes of interconnection topology structures and their properties, The toric ℎ-vectors of partially ordered sets, Tree-like properties of cycle factorizations, \(p,q\)-Stirling numbers and set partition statistics, Log concavity of a sequence in a conjecture of Simion, Descent classes of permutations with a given number of fixed points, Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution