We study the enumeration of inversion sequences that avoid the pattern 021 and another pattern of length four. We determine the generating trees for all possible pattern pairs and compute the corresponding generating functions. We introduce the concept of dregular generating trees and conjecture that for any 021-avoiding pattern τ , the generating tree T ({021, τ }) is d-regular for some integer d
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
We introduce an algorithmic approach based on generating tree method for enumerating the inversion s...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reduci...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
CombinatoricsThe problem of string pattern avoidance in generalized non-crossing trees is studied. T...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
We introduce an algorithmic approach based on generating tree method for enumerating the inversion s...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
The first problem addressed by this article is the enumeration of some families of pattern avoiding ...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reduci...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
CombinatoricsThe problem of string pattern avoidance in generalized non-crossing trees is studied. T...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...