AbstractPacking density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first article focusing exclusively on it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurren...
We study packing densities for set partitions, which is a generalization of packing words. We use re...
AMS Subject Classication: 05A15, 05A16 Abstract. In this paper, a result of Albert, Atkinson, Handle...
Packing density is a permutation occurrence statistic which describes the maximal num-ber of permuta...
AbstractPacking density is a permutation occurrence statistic which describes the maximal number of ...
By a pattern we mean a fixed permutation $\tau\ \in\ S\sb{m}$. An occurrence of a pattern $\tau$ in ...
By a pattern we mean a fixed permutation $\tau\ \in\ S\sb{m}$. An occurrence of a pattern $\tau$ in ...
In this article we generalize packing density problems from permutations and words to compositions. ...
In this article we generalize packing density problems from permutations and words to compositions. ...
AbstractIn this paper, we generalize the inductive techniques used in a previous paper [D. Warren, O...
Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many...
Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many...
It is known that the maximum number of layered patterns is achieved in layered permutations. This ge...
It is known that the maximum number of layered patterns is achieved in layered permutations. This ge...
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurren...
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurren...
We study packing densities for set partitions, which is a generalization of packing words. We use re...
AMS Subject Classication: 05A15, 05A16 Abstract. In this paper, a result of Albert, Atkinson, Handle...
Packing density is a permutation occurrence statistic which describes the maximal num-ber of permuta...
AbstractPacking density is a permutation occurrence statistic which describes the maximal number of ...
By a pattern we mean a fixed permutation $\tau\ \in\ S\sb{m}$. An occurrence of a pattern $\tau$ in ...
By a pattern we mean a fixed permutation $\tau\ \in\ S\sb{m}$. An occurrence of a pattern $\tau$ in ...
In this article we generalize packing density problems from permutations and words to compositions. ...
In this article we generalize packing density problems from permutations and words to compositions. ...
AbstractIn this paper, we generalize the inductive techniques used in a previous paper [D. Warren, O...
Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many...
Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many...
It is known that the maximum number of layered patterns is achieved in layered permutations. This ge...
It is known that the maximum number of layered patterns is achieved in layered permutations. This ge...
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurren...
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurren...
We study packing densities for set partitions, which is a generalization of packing words. We use re...
AMS Subject Classication: 05A15, 05A16 Abstract. In this paper, a result of Albert, Atkinson, Handle...