ECO:a methodology for the enumeration of combinatorial objects
From MaRDI portal
Recommendations
Cites work
- A method for the enumeration of various classes of column-convex polygons
- A methodology for plane tree enumeration
- Algebraic languages and polyominoes enumeration
- Catalan numbers, their generalization, and their uses
- Correspondences between plane trees and binary sequences
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- Hipparchus, Plutarch, Schroder, and Hough
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Motzkin numbers
- On Fluctuations in Coin-Tossing
- On the number of certain lattice polygons
- Permutations with forbidden subsequences and nonseparable planar maps
- Restricted plane tree representations of four Motzkin-Catalan equations
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
- The number of Baxter permutations
Cited in
(only showing first 100 items - show all)- Bounds on the number of numerical semigroups of a given genus
- Yet another method of enumerating unmarked combinatorial objects
- A methodology for plane tree enumeration
- A fast algorithm to generate necklaces with fixed content
- Object grammars and bijections.
- Jumping succession rules and their generating functions
- A linear operator approach to succession rules
- An algebraic characterization of the set of succession rules
- A new occurrence of Catalan numbers: cap permutations
- Characteristic polynomials of production matrices for geometric graphs
- Enumeration of compact coalescent histories for matching gene trees and species trees
- Semi-Baxter and strong-Baxter permutations
- Sequence characterizations of double Riordan arrays and their compressions
- Waiting patterns for a printer
- Production matrices
- New results on production matrices for geometric graphs
- From object grammars to ECO systems
- Parametric Catalan numbers and Catalan triangles
- Gray cycles of maximum length related to \(k\)-character substitutions
- Preimages under the bubblesort operator
- The enumeration of standard puzzles
- Subregularity in infinitely labeled generating trees of restricted permutations
- Raney numbers, threshold sequences and Motzkin-like paths
- Sorting with pattern-avoiding stacks: the 132-machine
- A relation between Schröder paths and Motzkin paths
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
- A new lower bound on the maximum number of plane graphs using production matrices
- Combinatorial aspects of \(L\)-convex polyominoes
- Generation and enumeration of some classes of interval orders
- Avoiding cross-bifix-free binary words
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Recurrence relations, succession rules and the positivity problem
- Enumeration via ballot numbers
- A linear algorithm for the random sampling from regular languages
- Finitely labeled generating trees and restricted permutations
- Proper generating trees and their internal path length
- Restricted signed permutations counted by the Schröder numbers
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Dyck paths and restricted permutations
- On directed-convex polyominoes in a rectangle
- On the equivalence problem for succession rules
- Lattices of lattice paths
- Enumeration of L-convex polyominoes by rows and columns
- In memoriam: Alberto Del Lungo (1965--2003)
- Efficient iteration in admissible combinatorial classes
- Wilf equivalences between vincular patterns in inversion sequences
- New production matrices for geometric graphs
- ECO-systems for Dyck and Schröder paths
- Recurrence relations, succession rules, and the positivity problem
- Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.
- On the enumeration of permutominoes
- Integral Representation and Algorithms for Closed Form Summation
- An exhaustive generation algorithm for Catalan objects and others
- scientific article; zbMATH DE number 2127714 (Why is no real title available?)
- A generating tree approach to k-nonnesting partitions and permutations
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- Generating involutions, derangements, and relatives by ECO
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- scientific article; zbMATH DE number 1984536 (Why is no real title available?)
- Succession rules and Deco polyominoes
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- On the sub-permutations of pattern avoiding permutations
- Matrix characterizations of Riordan arrays
- ECO-generation for some restricted classes of compositions
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Production matrices for geometric graphs
- Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- The orbiter ecosystem for combinatorial data
- An algorithm for deciding if a polyomino tiles the plane
- Enumeration Schemes for Restricted Permutations
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Combinatorial generation via permutation languages. I: Fundamentals
- Some linear recurrences and their combinatorial interpretation by means of regular languages
- Approximating algebraic functions by means of rational ones
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Restricting Dyck paths and 312-avoiding permutations
- Production matrices and riordan arrays
- Exterior corners on bargraphs of Motzkin words
- The double almost-Riordan group
- Combinatorial exploration: an algorithmic framework for enumeration
- Generating Trees and Fibonacci Polyominoes
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
- Enumeration of parallelogram polycubes
- On naturally labelled posets and permutations avoiding 12--34
- Combinatorial generation via permutation languages. IV: Elimination trees
- Centered ascending polyominoes
- Generation and enumeration of floorplans determined by \textit{HV}-matrices
- Binary words excluding a pattern and proper Riordan arrays
- Multivariate Fuss-Catalan numbers
- Mixed succession rules: the commutative case
- A history and a survey of lattice path enumeration
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
- More restrictive Gray codes for some classes of pattern avoiding permutations
- A general exhaustive generation algorithm for Gray structures
This page was built for publication: ECO:a methodology for the enumeration of combinatorial objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700083)
