اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCyclic Pattern Containment and Avoidance
97
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of permutation avoidance in cyclic permutations and characterized the avoidance classes for all single permutations of length 4. We continue this work. In particular, we establish a cyclic variant of the Erdos-Szekeres Theorem that any linear permutation of length mn+1 must contain either the increasing pattern of length m+1 or the decreasing pattern of length n+1. We then derive results about avoidance of multiple patterns of length 4. We also determine generating functions for the cyclic descent statistic on these classes. Finally, we end with various open questions and avenues for future research.
قيم البحث
اقرأ أيضاً
Given a set of permutations Pi, let S_n(Pi) denote the set of permutations in the symmetric group S_n that avoid every element of Pi in the sense of pattern avoidance. Given a subset S of {1,...,n-1}, let F_S be the fundamental quasisymmetric functio
n indexed by S. Our object of study is the generating function Q_n(Pi) = sum F_{Des sigma} where the sum is over all sigma in S_n(Pi) and Des sigma is the descent set of sigma. We characterize those Pi contained in S_3 such that Q_n(Pi) is symmetric or Schur nonnegative for all n. In the process, we show how each of the resulting Pi can be obtained from a theorem or conjecture involving more general sets of patterns. In particular, we prove results concerning symmetries, shuffles, and Knuth classes, as well as pointing out a relationship with the arc permutations of Elizalde and Roichman. Various conjectures and questions are mentioned throughout.
Jelinek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form ${sigma,tau}$ where $sigma$ is a set partition of size $3$ with at least two blocks. They obtained an upper bound for the number of Wilf-equivalence classes f
or such pairs. We show that their upper bound is the exact number of equivalence classes, thus solving a problem posed by them.
Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation sigma as a pattern, the shape of w contains the shape of sig
ma. As an application, we exhibit lower bounds for the lengths of supersequences of sets containing separable permutations.
Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the sum is ove
r all pi in S_n(Pi) and F_{Des pi} is the fundamental quasisymmetric function corresponding to the descent set of pi. Hamaker, Pawlowski, and Sagan introduced Q_n(Pi) and studied its properties, in particular, finding criteria for when this quasisymmetric function is symmetric or even Schur nonnegative for all n >= 0. The purpose of this paper is to continue their investigation answering some of their questions, proving one of their conjectures, as well as considering other natural questions about Q_n(Pi). In particular we look at Pi of small cardinality, superstandard hooks, partial shuffles, Knuth classes, and a stability property.
We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show that if $tau
$ is one of the finite increasing oscillations, then every $tau$-avoiding affine permutation satisfies the boundedness condition. We also explore the enumeration of pattern-avoiding affine permutations that can be decomposed into blocks, using analytic methods to relate their exact and asymptotic enumeration to that of the underlying ordinary permutations. Finally, we perform exact and asymptotic enumeration of the set of all bounded affine permutations of size $n$. A companion paper will focus on avoidance of monotone decreasing patterns in bounded affine permutations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
