1. Improvements on Permutation Reconstruction from Minors
- Author
-
Ma, Yiming, Zhong, Wenjie, and Zhang, Xiande
- Subjects
Mathematics - Combinatorics ,Mathematics - Optimization and Control - Abstract
We study the reconstruction problem of permutation sequences from their $k$-minors, which are subsequences of length $k$ with entries renumbered by $1,2,\ldots,k$ preserving order. We prove that the minimum number $k$ such that any permutation of length $n$ can be reconstructed from the multiset of its $k$-minors is between $\exp{(\Omega(\sqrt{\ln n}))}$ and $O(\sqrt{n\ln n})$. These results imply better bounds of a well-studied parameter $N_d$, which is the smallest number such that any permutation of length $n\ge N_d$ can be reconstructed by its $(n-d)$-minors. The new bounds are $ d+\exp(\Omega(\sqrt{\ln d}))
- Published
- 2024