scholarly journals Schur-Concavity for Avoidance of Increasing Subsequences in Block-Ascending Permutations

10.37236/7250 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Evan Chen

For integers $a_1, \dots, a_n \ge 0$ and $k \ge 1$, let $\mathcal L_{k+2}(a_1,\dots, a_n)$ denote the set of permutations of $\{1, \dots, a_1+\dots+a_n\}$ whose descent set is contained in $\{a_1, a_1+a_2, \dots, a_1+\dots+a_{n-1}\}$, and which avoids the pattern $12\dots(k+2)$. We exhibit some bijections between such sets, most notably showing that $\# \mathcal L_{k+2} (a_1, \dots, a_n)$ is symmetric in the $a_i$ and is in fact Schur-concave. This generalizes a set of equivalences observed by Mei and Wang.

10.37236/299 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Jeffrey Remmel ◽  
Manda Riehl

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation $\sigma$, $des(\sigma)$, arise in this way. For any given finite set $S$ of positive integers, we develop a method to produce similar generating functions for the set of permutations of the symmetric group $S_n$ whose descent set contains $S$. Our method will be to apply certain homomorphisms to symmetric function identities involving ribbon Schur functions.


2016 ◽  
Vol Vol. 18 no. 2, Permutation... (Permutation Patterns) ◽  
Author(s):  
Ran Pan ◽  
Jeffrey B. Remmel

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in $S_j$ is at least $3 -e$. Given a permutation $\sigma$, we let $\text{Des}(\sigma)$ denote the set of descents of $\sigma$. We study the class of permutations $\sigma \in S_{kn}$ whose descent set is contained in the set $\{k,2k, \ldots (n-1)k\}$. For example, up-down permutations in $S_{2n}$ are the set of permutations whose descent equal $\sigma$ such that $\text{Des}(\sigma) = \{2,4, \ldots, 2n-2\}$. There are natural analogues of the minimal overlapping permutations for such classes of permutations and we study the proportion of minimal overlapping patterns for each such class. We show that the proportion of minimal overlapping permutations in such classes approaches $1$ as $k$ goes to infinity. We also study the proportion of minimal overlapping patterns in standard Young tableaux of shape $(n^k)$. Comment: Accepted by Discrete Math and Theoretical Computer Science. Thank referees' for their suggestions


Technometrics ◽  
2018 ◽  
Vol 60 (3) ◽  
pp. 273-285 ◽  
Author(s):  
Kevin J. Wilson ◽  
Daniel A. Henderson ◽  
John Quigley

10.37236/4797 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Michael Albert ◽  
Cheyne Homberger ◽  
Jay Pantone

When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length $n$ patterns in the separable permutations is equal to the number of partitions of $n-1$.


2017 ◽  
Vol 17 (1) ◽  
Author(s):  
Hautahi Kingi

AbstractI analyze the welfare effects of a policy of modern sector enlargement (MSENL), and a policy of increasing the efficiency of on-the-job search from the urban informal sector (IEOS) in a generalized Harris-Todaro model. I show that MSENL causes a Lorenz worsening of the income distribution and IEOS causes a Lorenz improvement. In a rare direct application of the Atkinson theorem, I conclude that MSENL decreases social welfare and IEOS increases social welfare for all anonymous, increasing and Schur-concave social welfare functions.


2016 ◽  
Vol 339 (9) ◽  
pp. 2263-2266 ◽  
Author(s):  
Richard Ehrenborg ◽  
N. Bradley Fox
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document