138 citations
- Czech Academy of Sciences, Astronomical InstituteCZ3 papers
- Roma Tre UniversityIT3 papers
- Technical University of DenmarkDK3 papers
- Czech Academy of SciencesCZ2 papers
- Czech Academy of Sciences, Nuclear Physics InstituteCZ2 papers
- Microsoft (United States)US2 papers
- UCLA HealthUS2 papers
- University of California, Los AngelesUS2 papers
- A. Alikhanyan National LaboratoryAM1 paper
- Agence Parisienne du ClimatFR1 paper
- AlbaNovaSE1 paper
- Astronomical Institute of the Slovak Academy of SciencesSK1 paper
5 papers · 2 filters
Expected length of the longest common subsequence for large alphabets
Marcos Kiwi, Martin Loebl, Jiri Matousek
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…
On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
Extremal problems for ordered hypergraphs: small patterns and some enumeration
Martin Klazar
We investigate extremal functions ex_e(F,n) and ex_i(F,n) counting maximum numbers of edges and maximum numbers of vertex-edge incidences in simple hypergraphs H which have n verti…
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
Martin Klazar
We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generall…
The enumeration of simple permutations
M. H. Albert, M. D. Atkinson, M. Klazar
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results inclu…