Results 261 to 270 of about 2,353,350 (290)
Pattern Avoidance in Poset Permutations [PDF]
Order, 2015 We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $π$ is denoted $Av_P(π)$. We extend a proof of Simion and Schmidt to show that $Av_P(132) \leq Av_P(123)$ for any poset $P$, and we exactly classify ...
Samuel Hopkins
exaly +8 more sources
Strict bounds for pattern avoidance [PDF]
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri
exaly +6 more sources
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suijie Wang, Zhousheng Mei
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2019
So far this book has mostly focused on what we should do. It is also helpful to discuss the things we should not do. This chapter contains a list of anti-patterns – programming concepts and styles that we should avoid.
openaire +1 more source
So far this book has mostly focused on what we should do. It is also helpful to discuss the things we should not do. This chapter contains a list of anti-patterns – programming concepts and styles that we should avoid.
openaire +1 more source
Pattern Avoidance and Overlap in Strings
Combinatorics, Probability and Computing, 2002Consider a finite alphabet Ω and patterns which consist of characters from Ω. For a given pattern w, let cor(w) denote its autocorrelation, which can be seen as a measure of the amount of overlap in w. Letting aw(n) denote the number of strings over Ω of length n which do not contain w as a substring, the main result of this paper is: If cor(w) >
openaire +2 more sources