Results 11 to 20 of about 549,106 (324)
Pattern Avoidance in Task-Precedence Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with the poset.
Mitchell Paukner +3 more
doaj +6 more sources
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 $\pi$ is denoted $Av_P(\pi)$.
Sam Hopkins
exaly +6 more sources
Pattern Avoidance for Random Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a ...
Harry Crane, Stephen DeSalvo
doaj +3 more sources
Pattern Avoidance in Reverse Double Lists [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal.
Monica Anderson +3 more
doaj +3 more sources
Advances in Applied Mathematics, 2012 We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics of these sums.
Ehrenborg, Richard, Jung, JiYoon
core +3 more sources
Anick-type resolutions and consecutive pattern avoidance [PDF]
, 2010 For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra considerations in the same
Dotsenko, Vladimir, Khoroshkin, Anton
core +5 more sources
Patterns in matchings and rook placements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs.
Jonathan Bloom, Sergi Elizalde
doaj +5 more sources
Pattern avoidance and dominating compositions [PDF]
Enumerative Combinatorics and Applications, 2021 Krishna Menon, Anurag Singh
doaj +2 more sources
Pattern avoidance for set partitions \`a la Klazar [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In 2000 Klazar introduced a new notion of pattern avoidance in the context of set partitions of $[n]=\{1,\ldots, n\}$. The purpose of the present paper is to undertake a study of the concept of Wilf-equivalence based on Klazar's notion.
Jonathan Bloom, Dan Saracino
doaj +3 more sources
Pattern avoidance classes and subpermutations [PDF]
The Electronic Journal of Combinatorics, 2004 Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection.
Atkinson, M. D. +2 more
core +3 more sources