Twins in words and long common subsequences in permutations

DOI10.1007/s11856-016-1323-8zbMath1354.68213arXiv1307.0088OpenAlexW1793292512MaRDI QIDQ314398

Boris Bukh, Lidong Zhou

Publication date: 16 September 2016

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.0088

zbMATH Keywords

bounds for twin problempermutation wordword twins

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (12)

Universality for random permutations and some other groups ⋮ A note on the expected length of the longest common subsequences of two i.i.d. random permutations ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ Long twins in random words ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Erdős-Szekeres theorem for multidimensional arrays ⋮ Shuffle squares and reverse shuffle squares ⋮ On the longest common subsequence of conjugation invariant random permutations ⋮ Unnamed Item ⋮ Order-Isomorphic Twins in Permutations ⋮ Universal arrays ⋮ Variations on twins in permutations

Cites Work

• Unnamed Item
• A variational problem for random Young tableaux
• A regularity lemma and twins in words
• Expected length of the longest common subsequence for large alphabets
• The Difference Between Consecutive Primes, II
• The Value of Multiple Read/Write Streams for Approximating Frequency Moments
• Longest Common Subsequences in Sets of Words

This page was built for publication: Twins in words and long common subsequences in permutations