Results 1 to 10 of about 114,014 (293)
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 +3 more sources
Pattern avoidance and dominating compositions [PDF]
Enumerative Combinatorics and Applications, 2021 Krishna Menon, Anurag Singh
doaj +2 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 +2 more sources
Pattern avoidance in flattened derangements [PDF]
Discrete Mathematics LettersToufik Mansour, Mark Shattuck
doaj +2 more sources
From Permutation Patterns to the Periodic Table [PDF]
ریاضی و جامعه, 2023 (The above abstract has been extracted by the translator from the original article (L. Pudwell, From Permutation Patterns to the Periodic Table, Notices of the American Mathematical Society, 67 994–1001.))Abstract: Permutation patterns is a burgeoning ...
Saeid Alikhani, Maryam Safazadeh
doaj +1 more source
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 +1 more source
Pattern avoidance in dynamical systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed ...
José María Amigó +2 more
doaj +1 more source
Consecutive patterns in permutations: clusters and generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite families
Sergi Elizalde, Marc Noy
doaj +1 more source
Deodhar Elements in Kazhdan-Lusztig Theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The Kazhdan-Lusztig polynomials for finite Weyl groups arise in representation theory as well as the geometry of Schubert varieties. It was proved very soon after their introduction that they have nonnegative integer coefficients, but no simple all ...
Brant Jones
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2014 A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the embedding in MR.
Shirley Law
doaj +1 more source