We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Ste-ingŕımsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns. Counting is done via recurrences which simplify in the case of permutations. A collection of Maple procedures implementing these recurrences accompanies the article
This article discusses enumerating permutations whilst avoiding a pair of Babson-Steingrímsson patte...
A generalized motif bicluster algorithm In many application domains different clusters in data may b...
© 2018, The Author(s). Counting the number of times a pattern occurs in a database is a fundamental ...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We repro...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
Packing density is a permutation occurrence statistic which describes the maximal num-ber of permuta...
Abstract: Clustering is one of the several machine learning techniques to find out frequent patterns...
An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
Given two permutations σ ∈ Sk and pi = pi1... pin ∈ Sn, the permutation pi is said to contain the pa...
AbstractPacking density is a permutation occurrence statistic which describes the maximal number of ...
This article discusses enumerating permutations whilst avoiding a pair of Babson-Steingrímsson patte...
A generalized motif bicluster algorithm In many application domains different clusters in data may b...
© 2018, The Author(s). Counting the number of times a pattern occurs in a database is a fundamental ...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We repro...
Babson and Steingrimsson introduced generalized permutation patterns that allow the requirement that...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
Packing density is a permutation occurrence statistic which describes the maximal num-ber of permuta...
Abstract: Clustering is one of the several machine learning techniques to find out frequent patterns...
An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
Given two permutations σ ∈ Sk and pi = pi1... pin ∈ Sn, the permutation pi is said to contain the pa...
AbstractPacking density is a permutation occurrence statistic which describes the maximal number of ...
This article discusses enumerating permutations whilst avoiding a pair of Babson-Steingrímsson patte...
A generalized motif bicluster algorithm In many application domains different clusters in data may b...
© 2018, The Author(s). Counting the number of times a pattern occurs in a database is a fundamental ...