18 citations · 50 across the 28 of their papers we have counts for
32 papers
Motzkin paths, 321-avoiding permutations, and standard Young tableaux with rows of equal parity
Ryan Amaral, Ryan J. Amaral, Juan B. Gil +1
Motzkin paths of length and standard Young tableaux (SYT) with cells and at most three rows are both counted by the Motzkin numbers, and many bijections between them are kn…
Points of maximal traffic on a grid with obstruction
Juan Gil, Zhenni Liang, Ayodeji Odetola +1
For , we consider the set of lattice paths from to using only unit north and east steps. Given a point to be avoided, we ask: at which point …
On separable permutations and three other pairs in the Schröder class
Juan B. Gil, Oscar A. Lopez, Michael D. Weiner
We study positional statistics for four families of pattern-avoiding permutations counted by the large Schröder numbers. Specifically, we focus on the pairs of patterns $\{2413,314…
A positional statistic for 1324-avoiding permutations
Juan B. Gil, Oscar A. Lopez, Michael D. Weiner
We consider the class of permutations of size that avoid the pattern 1324 and examine the subset of elements for which ,…
Pattern-avoiding stabilized-interval-free permutations
Daniel Birmajer, Juan B. Gil, Jordan O. Tirrell +1
In this paper, we study pattern avoidance for stabilized-interval-free (SIF) permutations. These permutations are contained in the set of indecomposable permutations and in the set…
Restricted generating trees for weak orderings
Daniel Birmajer, Juan B. Gil, David S. Kenepp +1
Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain…