The following pages link to (Q3726126):
Displayed 50 items.
- Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets (Q1775739) (← links)
- Interior vertices in set partitions (Q1795488) (← links)
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group (Q1824026) (← links)
- Ordered trees with prescribed root degrees, node degrees, and branch lengths (Q1827732) (← links)
- The cyclic sieving phenomenon (Q1881679) (← links)
- The representation theory of the Temperley-Lieb algebras (Q1896773) (← links)
- A new way of counting \(n^ m\) (Q1903757) (← links)
- Ears of triangulations and Catalan numbers (Q1910592) (← links)
- Recursive statistics on words (Q1924366) (← links)
- Bijective enumeration of 3-factorizations of an \(N\)-cycle (Q1928586) (← links)
- Counting and computing the Rand and block distances of pairs of set partitions (Q1932369) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Multipoint correlation functions at phase separation. Exact results from field theory (Q2082953) (← links)
- Efficient linear-time ranking and unranking of derangements (Q2094363) (← links)
- Arborescences of covering graphs (Q2136408) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- Generating functions for plane partitions of a given shape (Q2277454) (← links)
- From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns (Q2326906) (← links)
- Probabilistic divide-and-conquer: deterministic second half (Q2407388) (← links)
- The perimeter and site-perimeter of set partitions (Q2420558) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Acyclic sets of linear orders via the Bruhat orders (Q2475989) (← links)
- Algorithmic combinatorics based on slicing posets (Q2503297) (← links)
- A direct bijection for the Harer-Zagier formula (Q2566803) (← links)
- Generalized triangulations and diagonal-free subsets of stack polyominoes (Q2568972) (← links)
- Trace identities from identities for determinants (Q2575019) (← links)
- The signed permutation group on Feynman graphs (Q2820908) (← links)
- Some conditional correlation inequalities for percolation and related processes (Q3419601) (← links)
- Positive Sum Systems (Q3466837) (← links)
- Linear Bandwidth Naccache-Stern Encryption (Q3540055) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
- Expansions of Chromatic Polynomials and Log-Concavity (Q4018926) (← links)
- New classes of interconnection topology structures and their properties (Q4229546) (← links)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem (Q4269106) (← links)
- Finitely constrained classes of homogeneous directed graphs (Q4292598) (← links)
- Isols and maximal intersecting classes (Q4304800) (← links)
- Baxter algebras and Hopf algebras (Q4419589) (← links)
- The toric ℎ-vectors of partially ordered sets (Q4501115) (← links)
- New refined enumerations of set partitions related to sorting (Q4559339) (← links)
- Counting corners in compositions and set partitions presented as bargraphs (Q4576744) (← links)
- (Q4605953) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- Lattice path proof of the ribbon determinant formula for Schur functions (Q4711201) (← links)
- Building uniformly random subtrees (Q4739579) (← links)
- Buses, Bullies, and Bijections (Q4961615) (← links)
- Visibility in non-crossing and non-nesting partitions (Q4991851) (← links)
- Determinant: Old algorithms, new insights (Q5054863) (← links)
- Set partitions and parity successions (Q5069986) (← links)
- Counting water cells in bargraphs of compositions and set partitions (Q5155719) (← links)
- On Erdős–Ko–Rado for Random Hypergraphs II (Q5219311) (← links)