Pages that link to "Item:Q4700083"

The following pages link to ECO:a methodology for the enumeration of combinatorial objects (Q4700083):

Displaying 33 items.

• A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
• Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
• Proper generating trees and their internal path length (Q2476251) (← links)
• Restricted signed permutations counted by the Schröder numbers (Q2488928) (← links)
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (Q2490021) (← links)
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (Q2494390) (← links)
• Dyck paths and restricted permutations (Q2499581) (← links)
• On directed-convex polyominoes in a rectangle (Q2566276) (← links)
• On the equivalence problem for succession rules (Q2566280) (← links)
• Lattices of lattice paths (Q2568422) (← links)
• Enumeration of L-convex polyominoes by rows and columns (Q2576881) (← links)
• In memoriam: Alberto Del Lungo (1965--2003) (Q2581342) (← links)
• Efficient iteration in admissible combinatorial classes (Q2581353) (← links)
• Wilf equivalences between vincular patterns in inversion sequences (Q2660332) (← links)
• New production matrices for geometric graphs (Q2666914) (← links)
• Recurrence Relations, Succession Rules, and the Positivity Problem (Q2799201) (← links)
• On the Enumeration of Permutominoes (Q2947868) (← links)
• Integral Representation and Algorithms for Closed Form Summation (Q3053877) (← links)
• A geometrical characterization of regions of uniqueness and applications to discrete tomography (Q3462582) (← links)
• Succession rules and Deco polyominoes (Q4494478) (← links)
• Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence (Q4561264) (← links)
• (Q5110962) (← links)
• Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees (Q5132590) (← links)
• The orbiter ecosystem for combinatorial data (Q5145951) (← links)
• An algorithm for deciding if a polyomino tiles the plane (Q5441544) (← links)
• Enumeration Schemes for Restricted Permutations (Q5448994) (← links)
• Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
• Some linear recurrences and their combinatorial interpretation by means of regular languages (Q5941096) (← links)
• Approximating algebraic functions by means of rational ones (Q5958324) (← links)
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels (Q6074662) (← links)
• Exterior corners on bargraphs of Motzkin words (Q6616842) (← links)
• The double almost-Riordan group (Q6650592) (← links)