Combinatorial exploration: an algorithmic framework for enumeration
From MaRDI portal
Cites work
- 1324-avoiding permutations revisited
- A counterexample regarding labelled well-quasi-ordering
- A method for the enumeration of various classes of column-convex polygons
- A new proof of the refined alternating sign matrix theorem
- A new record for \(1324\)-avoiding permutations
- A new upper bound for 1324-avoiding permutations
- A numerical study of L-convex polyominoes and 201-avoiding ascent sequences
- A polyominoes-permutations injection and tree-like convex polyominoes
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- An algorithm computing combinatorial specifications of permutation classes
- Analytic combinatorics
- Automatic discovery of structural rules of permutation classes
- Cell Growth Problems
- Classification of forbidden subsequences of length 4
- Cohomology of Smooth Schubert Varieties in Partial Flag Manifolds
- Counting 1324, 4231-avoiding permutations
- Counting 1324-avoiding permutations
- Counting \(\mathbf {(3+1)}\)-avoiding permutations
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Crossings and nestings of matchings and partitions
- ECO:a methodology for the enumeration of combinatorial objects
- Egge triples and unbalanced Wilf equivalence
- Enumerating indices of Schubert varieties defined by inclusions
- Enumeration and Wilf-classification of permutations avoiding five patterns of length 4
- Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
- Enumeration of 4-stack polyominoes
- Enumeration of L-convex polyominoes by rows and columns
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Enumeration of polyominoes inscribed in a rectangle
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
- Enumeration schemes and, more importantly, their automatic generation
- Enumeration Schemes for Restricted Permutations
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Finding regular insertion encodings for permutation classes
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Finitely labeled generating trees and restricted permutations
- Forbidden subsequences
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating permutations with restricted containers
- Generating trees and the Catalan and Schröder numbers
- Geometric properties of matrices induced by pattern avoidance
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 3989612 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 892258 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3054984 (Why is no real title available?)
- Inflations of geometric grid classes: three case studies
- Labelled well-quasi-order for permutation classes
- On \(1324\)-avoiding permutations
- On \(abab\)-free and \(abba\)-free set partitions
- On multiple pattern avoiding set partitions
- On partially ordered patterns of length 4 and 5 in permutations
- On permutation patterns with constrained gap sizes
- On permutations avoiding 1243, 2134, and another 4-letter pattern
- On permutations avoiding 1324, 2143, and another 4-letter pattern
- On the effective and automatic enumeration of polynomial permutation classes
- On the growth of merges and staircases of permutation classes
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- On two-dimensional percolation
- Pattern avoidance and fiber bundle structures on Schubert varieties
- Pattern avoidance for set partitions à la Klazar
- Pattern avoidance in alternating sign matrices
- Pattern avoidance in matchings and partitions
- Pattern avoidance in set partitions.
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Permutation classes
- Permutations avoiding 1324 and patterns in Łukasiewicz paths
- Permutations avoiding 4321 and 3241 have an algebraic generating function
- Permutations avoiding sets of patterns with long monotone subsequences
- Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
- Permutations generated by a stack of depth 2 and an infinite stack in series
- Permutations which are the union of an increasing and a decreasing subsequence
- Permutations with forbidden subsequences and a generalized Schröder number
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- Profile classes and partial well-order for permutations
- Proof of the alternating sign matrix conjecture
- Restricted growth function patterns and statistics
- Set partition patterns and statistics
- Stack-sorting preimages of permutation classes
- Staircases, dominoes, and the growth rate of 1324-avoiders
- Substitution-closed pattern classes
- Symmetric functions and P-recursiveness
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- The enumeration of permutations avoiding 2143 and 4231
- The enumeration of permutations avoiding 3124 and 4312
- The enumeration of three pattern classes using monotone grid classes
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system
- The number of Baxter permutations
- The number of {1243, 2134}-avoiding permutations
- The permutation class Av(4213,2143)
- The permutation classes \(\mathrm{Av}(1234, 2341)\) and \(\mathrm{Av}(1243, 2314)\)
- The permutation classes equinumerous to the smooth class
- The shape of random pattern-avoiding permutations
- The statistical mechanics of interacting walks, polygons, animals and vesicles
- The umbral transfer-matrix method. I: Foundations
- Three-letter-pattern avoiding permutations and functional equations
- Two examples of unbalanced Wilf-equivalence
- Two vignettes on full rook placements
- Une théorie combinatoire des séries formelles
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Using functional equations to enumerate 1324-avoiding permutations
- Which Schubert varieties are local complete intersections?
- Wilf classes of pairs of permutations of length 4
- Wilf classification of subsets of eight and nine four-letter patterns
- Wilf classification of subsets of four letter patterns
- Wilf classification of subsets of six and seven four-letter patterns
- Wilf classification of triples of 4-letter patterns
- Wilf classification of triples of 4-letter patterns. II
- Zero-one Schubert polynomials
Cited in
(2)
This page was built for publication: Combinatorial exploration: an algorithmic framework for enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848379)
