6 citations
9 papers
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…
On the enumeration of restricted words over a finite alphabet
Daniel Birmajer, Juan B. Gil, Michael D. Weiner
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used t…
Colored partitions of a convex polygon by noncrossing diagonals
Daniel Birmajer, Juan B. Gil, Michael D. Weiner
For any positive integers and , we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to …
Convolutions of Tribonacci, Fuss-Catalan, and Motzkin sequences
Daniel Birmajer, Juan B. Gil, Michael D. Weiner
We introduce a class of sequences, defined by means of partial Bell polynomials, that contains a basis for the space of linear recurrence sequences with constant coefficients as we…
Linear recurrence sequences and their convolutions via Bell polynomials
Daniel Birmajer, Juan B. Gil, Michael D. Weiner
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities…