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
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
On refinements of wilf-equivalence for involutions
Journal of Algebraic Combinatorics, 2023 Let $\mathcal{S}_n(π)$ (resp. $\mathcal{I}_n(π)$ and $\mathcal{AI}_n(π)$) denote the set of permutations (resp. involutions and alternating involutions) of length $n$ which avoid the permutation pattern $π$. For $k,m\geq 1$, Backelin-West-Xin proved that $|\mathcal{S}_n(12\cdots kτ)|= |\mathcal{S}_n(k\cdots 21τ)|$ by establishing a bijection between ...
Sherry H. F. Yan +2 more
openaire +2 more sources
On (shape-)Wilf-equivalence for words [PDF]
Advances in Applied Mathematics, 2018 AmS-LaTeX, 13 pages; minor ...
Guo, Ting +2 more
openaire +3 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
On avoidance of patterns of the form σ-τ by words over a finite alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Vincular or dashed patterns resemble classical patterns except that some of the letters within an occurrence are required to be adjacent. We prove several infinite families of Wilf-equivalences for $k$-ary words involving vincular patterns containing a ...
Toufik Mansour, Mark Shattuck
doaj +1 more source
Two examples of unbalanced Wilf-equivalence [PDF]
Journal of Combinatorics, 2015 10 pages, minor revision, to appear in Journal of ...
Burstein, Alexander, Pantone, Jay
openaire +2 more sources