Evaluation of an Employment Intervention for Veterans Transitioning From the Military: A Randomized Controlled Trial. [PDF]
Bond GR +8 more
europepmc +1 more source
New Wilf-equivalence results for dashed patterns
We give a sufficient condition for the two dashed patterns $ ^{(1)}- ^{(2)}-\cdots- ^{(\ell)}$ and $ ^{(\ell)}- ^{(\ell-1)}-\cdots- ^{(1)}$ to be (strongly) Wilf-equivalent. This permits to solve in a unified way several problems of Heubach and Mansour on Wilf-equivalences on words and compositions, as well as a conjecture of Baxter and Pudwell ...
openaire +2 more sources
A refinement of Wilf-equivalence for patterns of length 4
In their paper \cite{DokosDwyer:Permutat12}, Dokos et al. conjecture that the major index statistic is equidistributed among 1423-avoiding, 2413-avoiding, and 2314-avoiding permutations. In this paper we confirm this conjecture by constructing two major index preserving bijections, $Θ:S_n(1423)\to S_n(2413)$ and $Ω:S_n(2314)\to S_n(2413)$.
openaire +3 more sources
Pattern avoidance in labelled trees
We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words, permutations,
Dotsenko, Vladimir
core +1 more source
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Proof of a conjecture on the shape-Wilf-equivalence for partially ordered patterns
A partially ordered pattern (abbreviated POP) is a partially ordered set (poset) that generalizes the notion of a pattern when we are not concerned with the relative order of some of its letters. The notion of partially ordered patterns provides a convenient language to deal with large sets of permutation patterns.
Wang, Lintong, Yan, Sherry H. F.
openaire +3 more sources
A Wilf equivalence related to two stack sortable permutations
A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii) alone are equinumerous with the permutations on [n] that avoid the mixed scattered/consecutive pattern 31-4-2.
openaire +2 more sources
Pattern avoidance and dominating compositions [PDF]
Krishna Menon, Anurag Singh
doaj
Enumeration and Wilf-classification of permutations avoiding four patterns of length 4 [PDF]
Toufik Mansour
doaj
A primer on the use of probability generating functions in infectious disease modeling. [PDF]
Miller JC.
europepmc +1 more source

