PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES

DOI10.1142/S021819670200119XzbMath1041.05080arXivmath/0101093MaRDI QIDQ3043641

Edgar Martínez-Moro

Publication date: 6 August 2004

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

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

zbMATH Keywords

Bose-Mesner algebraGröbner basesBuchberger algorithmAssociation 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)

Related Items (1)

Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases

Cites Work

• On recognisable properties of associative algebras
• Gröbner bases and primary decomposition of polynomial ideals
• Galois correspondence between permutation groups and cellular rings (association schemes)
• 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
• Association schemes and coding theory

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