The following pages link to David Callan (Q449134):
Displaying 50 items.
- The run transform (Q449135) (← links)
- Restricted Stirling permutations (Q515059) (← links)
- Some bijections and identities for the Catalan and Fine numbers (Q817938) (← links)
- A bijection on Dyck paths and its cycle structure (Q874002) (← links)
- Klazar trees and perfect matchings (Q976148) (← links)
- Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials (Q1010838) (← links)
- Pattern avoidance in ``flattened'' partitions (Q1043596) (← links)
- The generation of \(\text{Sp}(\mathbb F_2)\) by transvections (Q1233082) (← links)
- The isomorphisms of unitary groups over noncommutative domains (Q1246041) (← links)
- Five subsets of permutations enumerated as weak sorting permutations (Q1728424) (← links)
- A uniformly distributed statistic on a class of lattice paths (Q1773166) (← links)
- Some combinatorial arrays related to the Lotka-Volterra system (Q2344824) (← links)
- Two Uniformly Distributed Parameters Defining Catalan Numbers (Q2757341) (← links)
- Permutations and Coin-Tossing Sequences (Q2773161) (← links)
- Restricted ascent sequences and Catalan numbers (Q2815239) (← links)
- (Q2855598) (← links)
- Some identities for derangement and Ward number sequences and related bijections (Q2973216) (← links)
- (Q3023984) (← links)
- (Q3023992) (← links)
- (Q3024017) (← links)
- Another Way to Discover that (Q3025922) (← links)
- Lagrange Inversion Counts $3\bar{5}241$-Avoiding Permutations (Q3100155) (← links)
- A Combinatorial Interpretation of a Catalan Numbers Identity (Q3153896) (← links)
- Another determinant condensation formula (Q3349039) (← links)
- (Q3536763) (← links)
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata (Q3575423) (← links)
- A Possible Permanent Formula (Q4324583) (← links)
- An Exploratory Approach to Kaplansky's Lemma Leads to a Generalized Resultant (Q4373320) (← links)
- (Q4398235) (← links)
- (Q4431526) (← links)
- (Q4506052) (← links)
- Wilf classification of triples of 4-letter patterns (Q4557838) (← links)
- (Q4557839) (← links)
- Five subsets of permutations enumerated as weak sorting permutations (Q4605544) (← links)
- (Q4831476) (← links)
- On evaluating permanents and a matrix of contangents<sup>∗</sup> (Q4838124) (← links)
- Flexagons Lead to a Catalan Number Identity (Q4908532) (← links)
- (Q5061522) (← links)
- On permutations avoiding 1324, 2143, and another 4-letter pattern (Q5218104) (← links)
- On permutations avoiding 1243, 2134, and another 4-letter pattern (Q5218105) (← links)
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns (Q5218110) (← links)
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns (Q5218111) (← links)
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done (Q5218122) (← links)
- Revitalized automatic proofs: demonstrations (Q5384148) (← links)
- (Q5387498) (← links)
- Sets, Lists and Noncrossing Partitions (Q5387548) (← links)
- (Q5395432) (← links)
- Permutations avoiding 4321 and 3241 have an algebraic generating function (Q6102519) (← links)
- The number of {1243, 2134}-avoiding permutations (Q6102521) (← links)
- A bijection to count (1-23-4)-avoiding permutations (Q6220197) (← links)
