A topology-based algorithm for the isomorphism check of 2-level Orthogonal Arrays
Roberto Fontana, Marco Guerra · arXiv (Cornell University) · 2024
We introduce a construction and an algorithm, both based on Topological Data Analysis (TDA), to tackle the problem of the isomorphism check of Orthogonal Arrays (OAs). Specifically, we associate to any binary OA a persistence diagram, one of the main tools in TDA, and explore how the Wasserstein distance between persistence diagrams can be used to inform whether two designs are isomorphic.