In this note we answer positively an open question posed by Yuster in 2020 [14] on the polynomial boundedness of the perfect sequence covering array number$$g(n,k)$$ g ( n , k ) (PSCA number). The latter determines the (renormalized) minimum row-count that perfect sequence covering arrays (PSCAs) can possess. PSCAs are matrices with permutations in $$S_n$$ S n as rows, such that each ordered k-sequence of distinct elements of $$[n]$$ [ n ] is covered by the same number of rows. We obtain the result after illuminating an isomorphism between this structure from design theory and a special case of min-wise independent permutations. Afterwards, we point out that asymptotic bounds and constructions can be transferred between these two structures. Moreover, we sharpen asymptotic lower bounds for g(n, k) and improve upper bounds for g(n, 4) and g(n, 3), for some concrete values of n. We conclude with some open questions and propose a new matrix class being potentially advantageous for searching PSCAs.
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.