The following pages link to Luca Ferrari (Q222131):
Displaying 50 items.
- (Q214527) (redirect page) (← links)
- The Dyck pattern poset (Q394536) (← links)
- Lattices of paths: representation theory and valutions (Q433479) (← links)
- Enumeration of chains and saturated chains in Dyck lattices. (Q472925) (← links)
- Greedy algorithms and poset matroids (Q473210) (← links)
- The Möbius function of the consecutive pattern poset (Q554000) (← links)
- Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations (Q604652) (← links)
- ECO species (Q624812) (← links)
- Production matrices and riordan arrays (Q659779) (← links)
- Mixed succession rules: the commutative case (Q965232) (← links)
- Jumping succession rules and their generating functions (Q1408865) (← links)
- A combinatorial representation for a special class of complete distributive lattices (Q1600817) (← links)
- A linear operator approach to succession rules (Q1601633) (← links)
- An algebraic characterization of the set of succession rules (Q1603697) (← links)
- Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset (Q1682613) (← links)
- Enumerative results on the Schröder pattern poset (Q1704103) (← links)
- Production matrices (Q1775729) (← links)
- Some bijective results about the area of Schröder paths (Q1885021) (← links)
- Catalan pairs: a relational-theoretic approach to Catalan numbers (Q1958940) (← links)
- Preimages under the Queuesort algorithm (Q1981689) (← links)
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset (Q2093265) (← links)
- Preimages under the bubblesort operator (Q2112565) (← links)
- On the generating functions of pattern-avoiding Motzkin paths (Q2133921) (← links)
- Permutation patterns in genome rearrangement problems: the reversal model (Q2181214) (← links)
- Sorting with pattern-avoiding stacks: the \(132\)-machine (Q2194083) (← links)
- Stack sorting with increasing and decreasing stacks (Q2288161) (← links)
- Stack sorting with restricted stacks (Q2306002) (← links)
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (Q2494390) (← links)
- Applying security policies through agent roles: a JAAS based approach (Q2509352) (← links)
- Lattices of lattice paths (Q2568422) (← links)
- Enumerating permutations avoiding three Babson-Steingrímsson patterns (Q2576462) (← links)
- Enumerative combinatorics of intervals in the Dyck pattern poset (Q2665832) (← links)
- Combinatorial properties of Catalan pairs (Q2851499) (← links)
- (Q2918614) (← links)
- (Q3077322) (← links)
- (Q3154660) (← links)
- (Q3377495) (← links)
- (Q3428798) (← links)
- The LAICA Project: An ad-hoc middleware to support Ambient Intelligence (Q3542776) (← links)
- Enumeration of some classes of words avoiding two generalized patterns of length three (Q3589631) (← links)
- (Q4807496) (← links)
- Catalan Lattices on Series Parallel Interval Orders (Q4910072) (← links)
- A partial order structure on interval orders (Q5273082) (← links)
- Unimodality and Dyck paths (Q5401054) (← links)
- Enumeration of edges in some lattices of paths (Q5404362) (← links)
- (Q5442544) (← links)
- (Q5746168) (← links)
- On the enumeration of d-minimal permutations (Q5747384) (← links)
- Classes of Dyck paths associated with numerical semigroups (Q5870592) (← links)
- An umbral calculus over infinite coefficient fields of positive characteristic (Q5948774) (← links)
