Backtracking algorithm for finding t‐designs | Zendy

MNoori M. | Zendy; TayfehRezaie B. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Backtracking algorithm for finding t‐designs

Author(s) -

MNoori M.,

TayfehRezaie B.

Publication year - 2003

Publication title -

journal of combinatorial designs

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.618

H-Index - 34

eISSN - 1520-6610

pISSN - 1063-8539

DOI - 10.1002/jcd.10045

Subject(s) - backtracking , automorphism group , automorphism , mathematics , prime (order theory) , order (exchange) , combinatorics , algorithm , discrete mathematics , finance , economics

A detailed description of an improved version of backtracking algorithms for finding t ‐designs proposed by G. B. Khosrovshahi and the authors of this paper [J Combin Designs 10 (2002), 180–194] is presented. The algorithm is then used to determine all 5‐(14,6,3) designs admitting an automorphism of order 13, 11, or 7. It is concluded that a 5‐(14,6,3) design with an automorphism of prime order p exists if and only if p=2,3,7,13. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 240–248, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10045

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research