The following pages link to Jean-Luc Baril (Q488294):
Displayed 50 items.
- Equivalence classes of Dyck paths modulo some statistics (Q488296) (← links)
- ECO-generation for some restricted classes of compositions (Q495405) (← links)
- A permutation code preserving a double Eulerian bistatistic (Q526811) (← links)
- Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations (Q616361) (← links)
- Classical sequences revisited with permutations avoiding dotted pattern (Q640434) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Whole mirror duplication-random loss model and pattern avoiding permutations (Q656610) (← links)
- Descent distribution on Catalan words avoiding a pattern of length at most three (Q724887) (← links)
- Pattern distributions in Dyck paths with a first return decomposition constrained by height (Q776321) (← links)
- A consecutive Lehmer code for parabolic quotients of the symmetric group (Q820843) (← links)
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Rooted planar maps modulo some patterns (Q906462) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
- Enumeration of Łukasiewicz paths modulo some patterns (Q1727771) (← links)
- Dyck paths with a first return decomposition constrained by height (Q1744745) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Gray code for derangements (Q1827847) (← links)
- Gray code for Cayley permutations (Q1884342) (← links)
- A Gray code for the shelling types of the boundary of a hypercube (Q1928446) (← links)
- Statistics-preserving bijections between classical and cyclic permutations (Q1941688) (← links)
- The pure descent statistic on permutations (Q2012552) (← links)
- Catalan and Schröder permutations sortable by two restricted stacks (Q2032179) (← links)
- Pattern statistics in faro words and permutations (Q2032888) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- Cyclic pattern containment and avoidance (Q2078930) (← links)
- Unknotted cycles (Q2088688) (← links)
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization (Q2155548) (← links)
- Gray codes for Fibonacci \(q\)-decreasing words (Q2163389) (← links)
- Bijections between directed animals, multisets and Grand-Dyck paths (Q2181997) (← links)
- Popularity of patterns over \(d\)-equivalence classes of words and permutations (Q2304570) (← links)
- A Motzkin filter in the Tamari lattice (Q2342623) (← links)
- Equivalence classes of permutations modulo excedances (Q2345759) (← links)
- Motzkin subposets and Motzkin geodesics in Tamari lattices. (Q2350595) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- Patterns in treeshelves (Q2404385) (← links)
- The irregularity strength of circulant graphs (Q2576828) (← links)
- Minimal change list for Lucas strings and some graph theoretic consequences (Q2581343) (← links)
- Knight's paths towards Catalan numbers (Q2699938) (← links)
- (Q2864442) (← links)
- (Q2931482) (← links)
- Equivalence classes of permutations modulo descents and left-to-right maxima (Q2973208) (← links)
- (Q3077253) (← links)
- (Q3077344) (← links)
- (Q3098785) (← links)
- (Q3467743) (← links)
- (Q4453451) (← links)
- Right-jumps and pattern avoiding permutations (Q4557005) (← links)