On Super-Strong Wilf Equivalence Classes of Permutations [PDF]
The Electronic Journal of Combinatorics, 2018 Super-strong Wilf equivalence is a type of Wilf equivalence on words that was originally introduced as strong Wilf equivalence by Kitaev et al. [Electron. J. Combin. 16(2)] in $2009$. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a ...
Demetris Hadjiloucas +2 more
openaire +4 more sources
On a Refinement of Wilf-equivalence for Permutations [PDF]
The Electronic Journal of Combinatorics, 2015 Recently, Dokos et al. conjectured that for all $k, m\geq 1$, the patterns $ 12\ldots k(k+m+1)\ldots (k+2)(k+1) $ and $(m+1)(m+2)\ldots (k+m+1)m\ldots 21$ are $maj$-Wilf-equivalent. In this paper, we confirm this conjecture for all $k\geq 1$ and $m=1$.
Sherry H. F. Yan, Huiyun Ge, Yaqiu Zhang
openaire +5 more sources
Operators of equivalent sorting power and related Wilf-equivalences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj +7 more sources
On (Shape-)Wilf-Equivalence of Certain Sets of (Partially Ordered) Patterns [PDF]
The Electronic Journal of CombinatoricsWe prove a conjecture of Gao and Kitaev on Wilf-equivalence of sets of patterns $\{12345,12354\}$ and $\{45123,45213\}$ that extends the list of 10 related conjectures proved in the literature in a series of papers. To achieve our goals, we prove generalized versions of shape-Wilf-equivalence results of Backelin, West, and Xin and use a particular ...
Burstein, Alexander +3 more
core +11 more sources
Rationality, irrationality, and Wilf equivalence in generalized factor order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $P$ be a partially ordered set and consider the free monoid $P^{\ast}$ of all words over $P$. If $w,w' \in P^{\ast}$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^{\ast}$ by letting $u \leq
Sergey Kitaev +3 more
doaj +8 more sources
Generating functions and Wilf equivalence for generalized interval embeddings. [PDF]
Australas. J Comb., 2016 In 1999 in [J. Difference Equ. Appl. 5, 355–377], Noonan and Zeilberger extended the Goulden-Jackson Cluster Method to find generating functions of word factors. Then in 2009 in [Electron. J. Combin.
Russell Chamberlain +5 more
core +3 more sources
Radiometric Constraints on the Timing, Tempo, and Effects of Large Igneous Province Emplacement
Geophysical Monograph Series, Page 27-82., 2021 Exploring the links between Large Igneous Provinces and dramatic environmental impact
An emerging consensus suggests that Large Igneous Provinces (LIPs) and Silicic LIPs (SLIPs) are a significant driver of dramatic global environmental and biological changes, including mass extinctions.
Jennifer Kasbohm +2 more
wiley +2 more sources
Pattern avoidance in partial permutations [PDF]
, 2011 Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ...
Claesson, A. +3 more
core +4 more sources
Bijections for generalized Wilf equivalences
Enumerative Combinatorics and ApplicationsStarting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized Wilf equivalences among consecutive patterns in inversion sequences, giving direct bijective proofs of some ...
Melanie Ferreri
doaj +3 more sources
A New Class of Wilf-Equivalent Permutations [PDF]
Journal of Algebraic Combinatorics, 2002 20 pages, 14 figures, corrected ...
Stankova, Zvezdelina, West, Julian
openaire +3 more sources