PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The extremal problem we consider is to study the maximum cardinality of a minimal suitable set of permutations. We give a lower bound of this maximum cardinality. Proof for the lower bound is constructive and produces corresponding sets of permutations. Some exact values are also determined.
Nianxin Ren
"On the largest minimal suitable sets of permutations", Proc. SPIE 12756, 3rd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2023), 1275609 (28 July 2023); https://doi.org/10.1117/12.2685909
ACCESS THE FULL ARTICLE
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Nianxin Ren, "On the largest minimal suitable sets of permutations," Proc. SPIE 12756, 3rd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2023), 1275609 (28 July 2023); https://doi.org/10.1117/12.2685909