Shuffle squares and reverse shuffle squares
From MaRDI portal
Publication:6189690
DOI10.1016/j.ejc.2023.103883arXiv2109.12455MaRDI QIDQ6189690
Ihyun Nam, Rishubh Thaper, Emily Huang, Xiaoyu He
Publication date: 5 February 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.12455
Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Enumerative combinatorics (05Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Twins in words and long common subsequences in permutations
- Dyck path enumeration
- A regularity lemma and twins in words
- Recognizing binary shuffle squares is \textsf{NP}-hard
- Unshuffling a square is NP-hard
- A linear space algorithm for computing maximal common subsequences
- Length of the Longest Common Subsequence between Overlapping Words
- Longest Common Subsequences in Sets of Words
- The Location of the First Ascent in a 123-Avoiding Permutation
- Bioinformatics and the Cell
This page was built for publication: Shuffle squares and reverse shuffle squares
