اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn plane permutations
178
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $omega$, for which $omega(12cdots n)$ has exactly $k$ cycles. This quantity is $0$, if $n-k$ is odd and $frac{2C(n+1,k)}{n(n+1)}$, otherwise, where $C(n,k)$ is the unsigned Stirling number of the first kind. The proof is facilitated by a natural transposition action on plane permutations which gives rise to various recurrences. Furthermore we study several distance problems of permutations. It turns out that plane permutations allow to study transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. Novel connections between these different distance problems are established via plane permutations.
قيم البحث
اقرأ أيضاً
In this paper, we introduce plane permutations, i.e. pairs $mathfrak{p}=(s,pi)$ where $s$ is an $n$-cycle and $pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct permutations:
the permutation induced by the upper horizontal ($s$), the vertical $pi$) and the diagonal ($D_{mathfrak{p}}$) of the array. The latter can also be viewed as the three permutations of a hypermap. In particular, a map corresponds to a plane permutation, in which the diagonal is a fixed point-free involution. We study the transposition action on plane permutations obtained by permuting their diagonal-blocks. We establish basic properties of plane permutations and study transpositions and exceedances and derive various enumerative results. In particular, we prove a recurrence for the number of plane permutations having a fixed diagonal and $k$ cycles in the vertical, generalizing Chapuys recursion for maps filtered by the genus. As applications of this framework, we present a combinatorial proof of a result of Zagier and Stanley, on the number of $n$-cycles $omega$, for which the product $omega(1~2~cdots ~n)$ has exactly $k$ cycles. Furthermore, we integrate studies on the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. Plane permutations allow us to generalize and recover various lower bounds for transposition and block-interchange distances and to connect reversals with block-interchanges.
An alternating permutation of length $n$ is a permutation $pi=pi_1 pi_2 ... pi_n$ such that $pi_1 < pi_2 > pi_3 < pi_4 > ...$. Let $A_n$ denote set of alternating permutations of ${1,2,..., n}$, and let $A_n(sigma)$ be set of alternating permutations
in $A_n$ that avoid a pattern $sigma$. Recently, Lewis used generating trees to enumerate $A_{2n}(1234)$, $A_{2n}(2143)$ and $A_{2n+1}(2143)$, and he posed several conjectures on the Wilf-equivalence of alternating permutations avoiding certain patterns. Some of these conjectures have been proved by Bona, Xu and Yan. In this paper, we prove the two relations $|A_{2n+1}(1243)|=|A_{2n+1}(2143)|$ and $|A_{2n}(4312)|=|A_{2n}(1234)|$ as conjectured by Lewis.
The maximum drop size of a permutation $pi$ of $[n]={1,2,ldots, n}$ is defined to be the maximum value of $i-pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of permutations of $[n]$ wit
h $d$ descents and maximum drop size not larger than $k$. Furthermore, Chung and Graham gave combinatorial interpretations of the coefficients of $Q_k(x)=x^k P_k(x)$ and $R_{n,k}(x)=Q_k(x)(1+x+cdots+x^k)^{n-k}$, and raised the question of finding a bijective proof of the symmetry property of $R_{n,k}(x)$. In this paper, we establish a bijection $varphi$ on $A_{n,k}$, where $A_{n,k}$ is the set of permutations of $[n]$ and maximum drop size not larger than $k$. The map $varphi$ remains to be a bijection between certain subsets of $A_{n,k}$. %related to the symmetry property. This provides an answer to the question of Chung and Graham. The second result of this paper is a proof of a conjecture of Hyatt concerning the unimodality of polynomials in connection with the number of signed permutations of $[n]$ with $d$ type $B$ descents and the type $B$ maximum drop size not greater than $k$.
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are ver
y important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange distance from which the existing lower bounds obtained by Bafna and Pevzner, and Christie can be easily derived. As to the reversal distance of signed permutations, we translate it into a block-interchange distance problem of permutations so that we obtain a new lower bound. Furthermore, studying distance problems via our framework motivates several interesting combinatorial problems related to product of permutations, some of which are studied in this paper as well.
A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate of its ev
en-size centrosymmetric elements. We present various examples where the latter growth rate is strictly less, but we conjecture that the reverse inequality cannot occur. We conjecture that equality holds if the class is sum closed, and we prove this conjecture in the special case where the growth rate is at most $xi approx 2.30522$, using results from Pantone and Vatter on growth rates less than $xi$. We prove one direction of inequality for sum closed classes and for some geometric grid classes. We end with preliminary findings on new kinds of growth-rate thresholds that are a little bit larger than $xi$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
