Results 31 to 40 of about 2,353,350 (290)
General and specific avoidance: the development and concurrent validation of a new measure of avoidance coping [PDF]
, 2014 Research on coping has been hampered by psychometric shortcomings in coping scales, which have typically relied on items based on face-value, extracted too many factors or lacked the evidence for the obtained structure from confirmatory factor analysis ...
Roger, D. +3 more
core +1 more source
Automatic collision avoidance of ships [PDF]
, 2008 One of the key elements in automatic simulation of ship manoeuvring in confined waterways is route finding and collision avoidance. This paper presents a new practical method of automatic trajectory planning and collision avoidance based on an artificial
Lee, B.S., Han, D., Xue, Y.
core +3 more sources
Doubled Patterns are 3-Avoidable [PDF]
The Electronic Journal of Combinatorics, 2016 In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h: \Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern $p$ is said to be $k$-avoidable if there exists an infinite word over a $k$-letter alphabet that avoids $p$.
openaire +5 more sources
European Journal of Combinatorics, 2001 Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly ...
openaire +4 more sources
, 2017 A set partition avoids a pattern if no subdivision of that partition standardizes to the pattern. There exists a bijection between set partitions and restricted growth functions (RGFs) on which Wachs and White defined four statistics of interest to this ...
Christensen, Emma
core +1 more source
Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121)
, 2023 This report documents the program and the outcomes of Dagstuhl Seminar 23121 "Pattern Avoidance, Statistical Mechanics and Computational Complexity"
Miklós, István +2 more
core +1 more source
Random Structures & AlgorithmsAbstract The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutation of order have a particularly simple structure.
Frederik Garbe +3 more
openaire +4 more sources
Permutation Pattern matching in (213, 231)-avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Given permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic subsequence.
Both Neou +2 more
doaj +1 more source
Alternating, Pattern-Avoiding Permutations [PDF]
The Electronic Journal of Combinatorics, 2009 We study the problem of counting alternating permutations avoiding collections of permutation patterns including $132$. We construct a bijection between the set $S_n(132)$ of $132$-avoiding permutations and the set $A_{2n + 1}(132)$ of alternating, $132$-avoiding permutations. For every set $p_1, \ldots, p_k$ of patterns and certain related patterns $
openaire +5 more sources
Pattern Avoidance by Even Permutations [PDF]
The Electronic Journal of Combinatorics, 2011 We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although some Wilf-equivalence results break when considering even-Wilf-equivalence analogues, we prove that other Wilf-equivalence results continue to hold in the even-Wilf ...
Andrew Baxter, Aaron D. Jaggard
openaire +4 more sources