50 citations · 195 across the 19 of their papers we have counts for
26 papers
Avoiding a pair of patterns in multisets and compositions
Vít Jelínek, Toufik Mansour, José L. Ramírez +1
In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of le…
On the growth of the Möbius function of permutations
Vít Jelínek, Ida Kantor, Jan Kynčl +1
We study the values of the Möbius function of intervals in the containment poset of permutations. We construct a sequence of permutations of size for which $μ(1,π_…
On grounded L-graphs and their relatives
Vít Jelínek, Martin Töpfer
We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are…
On the structure of matrices avoiding interval-minor patterns
Vít Jelínek, Stanislav Kučera
We study the structure of 01-matrices avoiding a pattern P as an interval minor. We focus on critical P-avoiders, i.e., on the P-avoiding matrices in which changing a 0-entry to a…
Splittability and 1-amalgamability of permutation classes
Vít Jelínek, Michal Opler
A permutation class is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations and in , each with…
Hardness of Permutation Pattern Matching
Vít Jelínek, Jan Kynčl
Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations and , represented as sequences of integers, and the task is to determine wh…