30 citations · 63 across the 9 of their papers we have counts for
9 papers
Central binomial coefficients also count (2431,4231,1432,4132)-avoiders
Marie-Louise Bruner
This short paper is concerned with the enumeration of permutations avoiding the following four patterns: , , and . Using a bijective construction, we prove…
On the Likelihood of Single-Peaked Preferences
Marie-Louise Lackner, Martin Lackner
This paper contains an extensive combinatorial analysis of the single-peaked domain restriction and investigates the likelihood that an election is single-peaked. We provide a very…
Parking functions for trees and mappings
Marie-Louise Bruner, Alois Panholzer
We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions ) by considering the nodes as parking space…
Log-concavity, the Ulam distance and involutions
Miklós Bóna, Marie-Louise Bruner
We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave s…
On restricted permutations on regular multisets
Marie-Louise Bruner
The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multiset…
The computational landscape of permutation patterns
Marie-Louise Bruner, Martin Lackner
In the last years, different types of patterns in permutations have been studied: vincular, bivincular and mesh patterns, just to name a few. Every type of permutation pattern natu…
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
Marie-Louise Bruner, Martin Lackner
The NP-complete Permutation Pattern Matching problem asks whether a -permutation is contained in a -permutation as a pattern. This is the case if there exists an orde…
A W[1]-Completeness Result for Generalized Permutation Pattern Matching
Marie-Louise Bruner, Martin Lackner
The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving em…
A short note on the Stanley-Wilf Conjecture for permutations on multisets
Marie-Louise Bruner
The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct pr…