Circulant association schemes on triples

DOI10.53733/106zbMATH Open1473.05326arXiv2104.02928OpenAlexW3199960867MaRDI QIDQ3380353FDOQ3380353

Authors: Cheryl E. Praeger, Prabir Bhattacharya 

Publication date: 28 September 2021

Published in: New Zealand Journal of Mathematics (Search for Journal in Brave)

Abstract: Association Schemes and coherent configurations (and the related Bose-Mesner algebra and coherent algebras) are well known in combinatorics with many applications. In the 1990s, Mesner and Bhattacharya introduced a three-dimensional generalisation of association schemes which they called an association scheme on triples (AST) and constructed examples of several families of ASTs. Many of their examples used 2-transitive permutation groups: the non-trivial ternary relations of the ASTs were sets of ordered triples of pairwise distinct points of the underlying set left invariant by the group; and the given permutation group was a subgroup of automorphisms of the AST. In this paper, we consider ASTs that do not necessarily admit 2-transitive groups as automorphism groups but instead a transitive cyclic subgroup of the symmetric group acts as automorphisms. Such ASTs are called circulant ASTs and the corresponding ternary relations are called circulant relations. We give a complete characterisation of circulant ASTs in terms of AST-regular partitions of the underlying set. We also show that a special type of circulant, that we call a thin circulant, plays a key role in describing the structure of circulant ASTs. We outline several open questions.

Full work available at URL: https://arxiv.org/abs/2104.02928

Recommendations

• Association schemes on triples and a ternary algebra
• Three-class association schemes from cyclotomy
• A survey on association schemes on triples
• A ternary algebra arising from association schemes on triples
• Schur rings and cyclic association schemes of class three
• scientific article; zbMATH DE number 416766
• Cyclotomic association schemes of broad classes and applications to the construction of combinatorial structures
• Triples in matroid circuits
• Commutative association schemes
• On association schemes with multiplicities 1 or 2

zbMATH Keywords

circulantspermutation groups\(k\)-relationsassociation schemes on triples

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Association schemes and coding theory
• Title not available (Why is that?)
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Dale Mesner, Higman \& Sims, and the strongly regular graph with parameters \((100,22,0,6)\)
• Theory of Association Schemes
• Association schemes and permutation groups
• Title not available (Why is that?)
• Coherent algebras
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• Coherent configurations. I
• On finite permutation groups with a transitive cyclic subgroup.
• Matchings in regular graphs
• Title not available (Why is that?)
• A ternary algebra arising from association schemes on triples
• Association schemes on triples and a ternary algebra
• On the spectra of hypermatrix direct sum and Kronecker products constructions
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• Generosity and Characters of Multiply Transitive Permutation Groups
• Planar algebras: a category theoretic point of view
• Title not available (Why is that?)
• Association schemes and fusion algebras. (An introduction)
• Introduction to association schemes
• Adjacency spectra of random and complete hypergraphs
• Derangement action digraphs and graphs
• On the Bhattacharya-Mesner rank of third order hypermatrices
• A combinatorial approach to transitive extensions of generously unitransitive permutation groups

Cited In (4)

• Title not available (Why is that?)
• A survey on association schemes on triples
• Every 3-equivalenced association scheme is Frobenius
• Association schemes on triples over few vertices

This page was built for publication: Circulant association schemes on triples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380353)