Pages that link to "Item:Q4700083"
From MaRDI portal
The following pages link to ECO:a methodology for the enumeration of combinatorial objects (Q4700083):
Displaying 50 items.
- A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488) (← links)
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry (Q404464) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Matrix characterizations of Riordan arrays (Q471919) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations (Q604652) (← links)
- Production matrices and riordan arrays (Q659779) (← links)
- Binary words excluding a pattern and proper Riordan arrays (Q870961) (← links)
- Multivariate Fuss-Catalan numbers (Q942097) (← links)
- Mixed succession rules: the commutative case (Q965232) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- Restricted 123-avoiding Baxter permutations and the Padovan numbers (Q997068) (← links)
- Bounds on the number of numerical semigroups of a given genus (Q1008747) (← links)
- A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
- Object grammars and bijections. (Q1401204) (← links)
- Jumping succession rules and their generating functions (Q1408865) (← links)
- A linear operator approach to succession rules (Q1601633) (← links)
- An algebraic characterization of the set of succession rules (Q1603697) (← links)
- Lattice paths with catastrophes (Q1687786) (← links)
- A new occurrence of Catalan numbers: cap permutations (Q1687787) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- Enumeration of compact coalescent histories for matching gene trees and species trees (Q1738019) (← links)
- Semi-Baxter and strong-Baxter permutations (Q1745110) (← links)
- Sequence characterizations of double Riordan arrays and their compressions (Q1747115) (← links)
- Waiting patterns for a printer (Q1765244) (← links)
- Production matrices (Q1775729) (← links)
- New results on production matrices for geometric graphs (Q1792103) (← links)
- From object grammars to ECO systems (Q1884915) (← links)
- Parametric Catalan numbers and Catalan triangles (Q1931755) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Preimages under the bubblesort operator (Q2112565) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- Raney numbers, threshold sequences and Motzkin-like paths (Q2166306) (← links)
- Sorting with pattern-avoiding stacks: the \(132\)-machine (Q2194083) (← links)
- A relation between Schröder paths and Motzkin paths (Q2227989) (← links)
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences (Q2315433) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Combinatorial aspects of \(L\)-convex polyominoes (Q2372433) (← links)
- Generation and enumeration of some classes of interval orders (Q2376909) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers (Q2422019) (← links)
- Recurrence relations, succession rules and the positivity problem (Q2424677) (← links)
- Enumeration via ballot numbers (Q2427513) (← links)
