Results 301 to 310 of about 549,106 (324)

Pattern avoidance in biwords

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhousheng Mei, Suijie Wang
exaly   +3 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   +2 more sources

Pattern avoidance in “flattened” partitions

Discrete Mathematics, 2009
To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each block and blocks arranged in increasing order of their first entries--we count the partitions of [n] whose ...
David Callan
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Pattern Avoidance and Overlap in Strings

Combinatorics, Probability and Computing, 2002
Consider 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   +1 more source

Avoid Anti-Patterns

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

Spatiotemporal pattern selection in a nontoxic-phytoplankton - toxic-phytoplankton - zooplankton model with toxin avoidance effects

Applied Mathematics and Computation, 2022
Feifan Zhang, Wang Tian
exaly  

On avoidance of V- and ^-patterns in permutations.

Ars Comb., 2010
We study V- and ^-patterns which generalize valleys and peaks, as well as increasing and decreasing runs, in permutations. A complete classi¯cation of permutations (multi)-avoiding V- and ¤-patterns of length 4 is given. We also establish a connection between restricted permutations and matchings in the coronas of complete graphs.
Kitaev, Sergey, Pyatkin, Artem
openaire   +1 more source

The undirected repetition threshold and undirected pattern avoidance

Theoretical Computer Science, 2021
Lucas Mol
exaly