Abstract
An (n, k)-perfect sequence covering array with multiplicity \(\lambda \), denoted \(\mathrm{{PSCA}}(n,k,\lambda )\), is a multiset whose elements are permutations of the sequence \((1,2, \dots , n)\) and which collectively contain each ordered length k subsequence exactly \(\lambda \) times. The primary objective is to determine for each pair (n, k) the smallest value of \(\lambda \), denoted g(n, k), for which a \(\mathrm{{PSCA}}(n,k,\lambda )\) exists; and more generally, the complete set of values \(\lambda \) for which a \(\mathrm{{PSCA}}(n,k,\lambda )\) exists. Yuster recently determined the first known value of g(n, k) greater than 1, namely \(g(5,3)=2\), and suggested that finding other such values would be challenging. We show that \(g(6,3)=g(7,3)=2\), using a recursive search method inspired by an old algorithm due to Mathon. We then impose a group-based structure on a perfect sequence covering array by restricting it to be a union of distinct cosets of a prescribed nontrivial subgroup of the symmetric group \(S_n\). This allows us to determine the new results that \(g(7,4)=2\) and \(g(7,5) \in \{2,3,4\}\) and \(g(8,3) \in \{2,3\}\) and \(g(9,3) \in \{2,3,4\}\). We also show that, for each \((n,k) \in \{ (5,3), (6,3), (7,3), (7,4) \}\), there exists a \(\mathrm{{PSCA}}(n,k,\lambda )\) if and only if \(\lambda \ge 2\); and that there exists a \(\mathrm{{PSCA}}(8,3,\lambda )\) if and only if \(\lambda \ge g(8,3)\).
Similar content being viewed by others
Data availability
All data on which the conclusions of this paper depend are included here.
References
Apilli B.: Fault-based combinatorial testing of web services. In: Proceedings of 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications, pp. 731–732 (2009).
Bennett F.E., Mahmoodi A.: Directed designs. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 441–444. Chapman and Hall, Boca Raton (2007).
Chee Y.M., Colbourn C.J., Horsley D., Zhou J.: Sequence covering arrays. SIAM J. Discret. Math. 27(4), 1844–1861 (2013).
Colbourn C.J.: Covering arrays and hash families. In: Crnković D., Tonchev V. (eds.) Information Security, pp. 99–135. Coding Theory and Related Combinatorics. IOS Press, Amsterdam (2011).
Dawson J.E., Seberry J., Skillicorn D.B.: The directed packing numbers DD\((t, v, v)\), \(t \ge 4\). Combinatorica 4(2–3), 121–130 (1984).
Füredi Z.: Scrambling permutations and entropy of hypergraphs. Random Struct. Algor. 8(2), 97–104 (1996).
Gentle A.R., Wanless I.M.: On perfect sequence covering arrays. Ann. Comb. (2022). arXiv:2202.01960.
Huang S., Cohen M.B., Memon A.M.: Repairing GUI test suites using a genetic algorithm. In: 2010 Third International Conference on Software Testing, Verification and Validation, pp. 245–254 (2010).
Ishigami Y.: An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements. Discret. Math. 159(1–3), 279–283 (1996).
Klein A.: On perfect deletion-correcting codes. J. Comb. Des. 12(1), 72–77 (2004).
Kuhn D.R., Higdon J.M., Lawrence J.F., Kacker R.N., Lei Y.: Combinatorial methods for event sequence testing. In: 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp. 601–609 (2012).
Levenshtein V.I.: Perfect deletion-correcting codes as combinatorial designs. In: II International Workshop Algebraic and Combinatorial Coding Theory, pp. 137–140 (1990).
Levenshtein V.I.: Perfect codes in the metric of deletions and insertions. Diskr. Mat. 3(1), 3–20 (1991). English translation in: Discret. Math. Appl. 2(3), 241–258 (1992).
Mathon R.: Searching for spreads and packings. In: Hirschfeld J.W.P., Magliveras S.S., de Resmini M.J. (eds.) Geometry, Combinatorial Designs and Related Structures. Proceedings of First Pythagorean Conference, pp. 161–176. Cambridge University Press, Cambridge (1997).
Mathon R., van Trung T.: Directed \(t\)-packings and directed \(t\)-Steiner systems. Des. Codes Cryptogr. 18, 187–198 (1999).
Na J.: Perfect sequence covering arrays. Master’s thesis, Simon Fraser University (2021).
Radhakrishnan J.: A note on scrambling permutations. Random Struct. Algor. 22(4), 435–439 (2003).
Spencer J.: Minimal scrambling sets of simple orders. Acta Math. Hung. 22(3–4), 349–353 (1971).
The GAP Group. GAP—Groups, Algorithms, and Programming, Version 4.11.0 (2020).
Wang W., Sampath S., Lei Y., Kacker R.: An interaction-based test sequence generation approach for testing web applications. In: 2008 11th IEEE High Assurance Systems Engineering Symposium, pp. 209–218 (2008).
Wang W., Lei Y., Sampath S., Kacker R., Kuhn R., Lawrence J.: A combinatorial approach to building navigation graphs for dynamic web applications. In: 2009 IEEE International Conference on Software Maintenance, pp. 211–220 (2009).
Wilson R.M.: A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)-subsets. Eur. J. Comb. 11, 609–615 (1990).
Yuan X., Memon A.M.: Generating event sequence-based test cases using GUI runtime state feedback. IEEE Trans. Softw. Eng. 36(1), 81–95 (2010).
Yuan X., Cohen M.B., Memon A.M.: GUI interaction testing: incorporating event context. IEEE Trans. Softw. Eng. 37(4), 559–574 (2011).
Yuster R.: Perfect sequence covering arrays. Des. Codes Cryptogr. 88, 585–593 (2020).
Acknowledgements
The authors gratefully acknowledge helpful discussions with Karen Meagher and Charlie Colbourn.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. J. Colbourn.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
J. Na is supported by a PhD Scholarship from the China Scholarship Council. J. Jedwab is supported by an NSERC Discovery Grant. S. Li is supported by a PIMS Postdoctoral Fellowship .
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Na, J., Jedwab, J. & Li, S. A group-based structure for perfect sequence covering arrays. Des. Codes Cryptogr. 91, 951–970 (2023). https://doi.org/10.1007/s10623-022-01132-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01132-1