The following pages link to Elisa Pergola (Q180269):
Displaying 50 items.
- (Q221648) (redirect page) (← links)
- A bijective approach to the area of generalized Motzkin paths (Q696823) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Directed animals, forests and permutations (Q1300965) (← links)
- Some combinatorial interpretations of \(q\)-analogs of Schröder numbers (Q1306593) (← links)
- Stirling numbers interpolation using permutations with forbidden subsequences (Q1348146) (← links)
- A methodology for plane tree enumeration (Q1381812) (← links)
- Lattice path moments by cut and paste (Q1398297) (← links)
- Jumping succession rules and their generating functions (Q1408865) (← links)
- Enumeration of vexillary involutions which are equal to their mirror/complement (Q1586779) (← links)
- Vexillary involutions are enumerated by Motzkin numbers (Q1600801) (← links)
- An algebraic characterization of the set of succession rules (Q1603697) (← links)
- A combinatorial interpretation of the area of Schröder paths (Q1806355) (← links)
- Some bijective results about the area of Schröder paths (Q1885021) (← links)
- Exhaustive generation of combinatorial objects by ECO (Q1889882) (← links)
- From Motzkin to Catalan permutations (Q1978172) (← links)
- Burrows-Wheeler transform of words defined by morphisms (Q2301759) (← links)
- Generation and enumeration of some classes of interval orders (Q2376909) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Recurrence relations, succession rules and the positivity problem (Q2424677) (← links)
- Non-uniform random generation of generalized Motzkin paths (Q2491216) (← links)
- On the equivalence problem for succession rules (Q2566280) (← links)
- In memoriam: Alberto Del Lungo (1965--2003) (Q2581342) (← links)
- On doubly symmetric Dyck words (Q2664949) (← links)
- Structure and complexity of 2-intersection graphs of 3-hypergraphs (Q2689256) (← links)
- (Q2755037) (← links)
- Pattern 1^j0^i avoiding binary words (Q2789513) (← links)
- Recurrence Relations, Succession Rules, and the Positivity Problem (Q2799201) (← links)
- Pattern 1j+10j Avoiding Binary Words (Q2898445) (← links)
- (Q2915596) (← links)
- (Q2915607) (← links)
- (Q2918614) (← links)
- A generating function for bit strings with no Grand Dyck pattern matching (Q2973209) (← links)
- (Q3077345) (← links)
- On the exhaustive generation of convex permutominoes (Q3077347) (← links)
- Cross-bifix-free sets generation <i>via </i>Motzkin paths (Q3186677) (← links)
- (Q3457635) (← links)
- (Q4208544) (← links)
- (Q4428901) (← links)
- (Q4502594) (← links)
- (Q4524577) (← links)
- Pattern Avoiding Languages and Recurrence Relations Interpretation (Q4606259) (← links)
- ECO:a methodology for the enumeration of combinatorial objects (Q4700083) (← links)
- (Q4954008) (← links)
- A New Approach to Cross-Bifix-Free Sets (Q5271867) (← links)
- (Q5326718) (← links)
- Six bijections between deco polyominoes and permutations (Q5326720) (← links)
- Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns (Q5387508) (← links)
