Paper
28 July 2023 On the largest minimal suitable sets of permutations
Nianxin Ren
Author Affiliations +
Proceedings Volume 12756, 3rd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2023); 1275609 (2023) https://doi.org/10.1117/12.2685909
Event: 2023 3rd International Conference on Applied Mathematics, Modelling and Intelligent Computing (CAMMIC 2023), 2023, Tangshan, China
Abstract
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.
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Back to Top