Existence of schematic arrays under a novel criterion

Zuolu Hao and Yu Tang

Communications in Statistics - Theory and Methods, 2025, vol. 54, issue 1, 70-83

Abstract: As an important combinatorial structure, association scheme plays an important role in many fields, such as coding theory, graph theory, and combinatorial design. An array is called a schematic if its runs form an association scheme with respect to a certain classification criterion. However, at present, the existing research results about the schematic array are only based on the distance classification criterion, which dramatically limits the existing results on schematic arrays. This article presents a novel matching classification criterion, called MC-criterion, which, together with the existing distance classification, forms a general framework for classification. An array is called G-schematic if its runs form an association scheme with respect to MC-criterion. Subsequently, this article proves that the existence of two types of G-schematic arrays.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2024.2301979 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:54:y:2025:i:1:p:70-83

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2024.2301979

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().