Constructive combinatorics
This volume is the amplification of course notes in the area of 'constructive combinatorics'. This area includes the enumeration and listing of various kinds of finite structures as well as use of constructive arguments to prove theorems. The text is suitable for an undergraduate level, involving few if any prerequisites. Further, it covers an attractive selection of topics and is full of stimulating questions and clever arguments that will be inspirational to many mathematics students. A strong point is the set of exercises which are numerous and at various levels of challenge. There is also an appendix containing programs which implement some of the algorithms discussed in the text. The subject matter is divided into four chapters; the first concerns enumeration of basic structures, such as permutations and partitions of sets and of integers, with emphasis on actual listing of such entities. The second concerns partially ordered sets including application to the Littlewood-Offord problem. A section on bijections, including discussion of the Prüfer Correspondence and Schensted's Correspondence and tableaux is the largest chapter. Finally, a chapter entitled 'Involutions' contains discussions of such topics as Vandermonde's determinant, the Cayley-Hamilton theorem and the matrix-tree theorem, and of lattice paths. This subject matter has the virtue that one can get into non-trivial mathematical results without bogging down in definitions or requiring lots of prior knowledge. It is an ideal ground therefore, for a student to be exposed to in order to realize that she or he loves mathematics and can relate to it. I therefore think that courses in this area should be encouraged. This is an excellent text for such a course.
- RNA secondary structure, permutations, and statistics
- The Gram determinant of the type B Temperley-Lieb algebra
- Gray codes, loopless algorithm and partitions
- The coolest way to generate combinations
- Classical partition functions and the \(U(n+1)\) Rogers-Selberg identity
- Identities of Rothe-Abel-Schläfli-Hurwitz-type
- Lattice path enumeration by formal schema
- A unified combinatorial approach for \(q\)- (and \(p,q\)-) Stirling numbers
- 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
- Descent classes of permutations with a given number of fixed points
- Average cost of Duval's algorithm for generating Lyndon words
- Duality of graded graphs
- Interpolating set partition statistics
- -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
- Schensted algorithms for dual graded graphs
- Off-line algorithms for the list update problem
- A bijection between Proctor's and Sundaram's odd orthogonal tableaux
- Finding parity difference by involutions
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- Integrals over Grassmannians and random permutations.
- A combinatorial interpretation of the inverse \(t\)-Kostka matrix.
- Generalized rook polynomials
- Tree-like properties of cycle factorizations
- Log concavity of a sequence in a conjecture of Simion
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
- The odd-even invariant and Hamiltonian circuits in tope graphs
- Dual-antiprisms and partitions of powers of 2 into powers of 2
- Factorial characters of the classical Lie groups
- Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
- Interior vertices in set partitions
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- The cyclic sieving phenomenon
- The representation theory of the Temperley-Lieb algebras
- A new way of counting \(n^ m\)
- Ears of triangulations and Catalan numbers
- Recursive statistics on words
- Bijective enumeration of 3-factorizations of an \(N\)-cycle
- Counting and computing the Rand and block distances of pairs of set partitions
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Multipoint correlation functions at phase separation. Exact results from field theory
- Efficient linear-time ranking and unranking of derangements
- Arborescences of covering graphs
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Generating functions for plane partitions of a given shape
- From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns
- Probabilistic divide-and-conquer: deterministic second half
- The perimeter and site-perimeter of set partitions
- Efficient generation of restricted growth words
- Acyclic sets of linear orders via the Bruhat orders
- Algorithmic combinatorics based on slicing posets
- A direct bijection for the Harer-Zagier formula
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Trace identities from identities for determinants
- The signed permutation group on Feynman graphs
- Some conditional correlation inequalities for percolation and related processes
- Positive sum systems
- Linear Bandwidth Naccache-Stern Encryption
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Some enumerative results related to ascent sequences
- scientific article; zbMATH DE number 43827 (Why is no real title available?)
- scientific article; zbMATH DE number 66612 (Why is no real title available?)
- Expansions of Chromatic Polynomials and Log-Concavity
- Stanley decompositions and Hilbert depth in the Koszul complex
- New classes of interconnection topology structures and their properties
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Finitely constrained classes of homogeneous directed graphs
- Isols and maximal intersecting classes
- Baxter algebras and Hopf algebras
- Construction of combinatorial pyramids
- The toric ℎ-vectors of partially ordered sets
- New refined enumerations of set partitions related to sorting
- Catalan numbers and pattern restricted set partitions
- Counting corners in compositions and set partitions presented as bargraphs
- scientific article; zbMATH DE number 6845241 (Why is no real title available?)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Lattice path proof of the ribbon determinant formula for Schur functions
- Building uniformly random subtrees
- Buses, bullies, and bijections
- Visibility in non-crossing and non-nesting partitions
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Determinant: Old algorithms, new insights
- Set partitions and parity successions
- Counting water cells in bargraphs of compositions and set partitions
- On Erdős-Ko-Rado for random hypergraphs. II
- Counting set partitions by the number of movable letters
- Counting 1 2 rectangles in set partitions
- Renormalization of two—terminal reliability
- Restricted partitions and \(q\)-Pell numbers
- Dyck paths of knight moves
- Counting occurrences of subword patterns in non-crossing partitions
- Catalan numbers revisited
- Skew diagrams and ordered trees
- Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
- Equivariant log-concavity of graph matchings
This page was built for publication: Constructive combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3726126)