PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES

DOI10.1142/S021819670200119XzbMATH Open1041.05080arXivmath/0101093MaRDI QIDQ3043641FDOQ3043641

Authors: E. Martínez-Moro 

Publication date: 6 August 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can characterize completely the Bose-Mesner algebra in terms of a zero-dimensional ideal. A Gr"obner basis of this ideal can be easily derived without the use of Buchberger algorithm in an efficient way. From this statement, some nice relations arise between the treatment of zero-dimensional ideals by reordering techniques (FGLM techniques) and some properties of the schemes such as P-polynomiality, and minimal generators of the algebra.

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

Recommendations

• Commutative association schemes
• scientific article; zbMATH DE number 17248
• Non-commutative association schemes and their fusion association schemes
• Algebraic decompositions of commutative association schemes
• An algebraic approach to association schemes
• Association schemes and fusion algebras. (An introduction)
• Commutativity of association schemes of order \(pq\)
• On association schemes with commutative thin thin residue
• On morphisms of association schemes
• A Class of Association Schemes and Their Automorphisms

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]Buchberger algorithmBose-Mesner algebraAssociation schemes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Association schemes, strongly regular graphs (05E30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cites Work

• Association schemes and coding theory
• Gröbner bases and primary decomposition of polynomial ideals
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Computing Gröbner bases by FGLM techniques in a non-commutative setting
• Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
• Galois correspondence between permutation groups and cellular rings (association schemes)
• On recognisable properties of associative algebras

Cited In (3)

• Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases
• Title not available (Why is that?)
• Using Gröbner bases to investigate flag algebras and association scheme fusion

This page was built for publication: PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES

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