Computation of isotopisms of algebras over finite fields by means of graph invariants

DOI10.1016/J.CAM.2016.09.002MaRDI QIDQ507895zbMATH OpenOpenAlexFDO

Authors A. M. Pacheco, Juan Núñez Valdés, Óscar J. Falcón, Raúl M. Falcón, M. T. Villar

Publication date 9 February 2017

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldisomorphismLatin square

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Abstract: In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine whether two algebras are isomorphic. In order to illustrate their efficiency, we determine explicitly the classification of two- and three-dimensional partial quasigroup rings.

Recommendations

• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
• The isomorphism problem for varieties generated by a two-element algebra
• Graph algebras and the graph isomorphism problem
• Testing isomorphism of graded algebras
• Computing automorphism groups and testing isomorphisms for modular group algebras.

Cites work

• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 3443668 (Why is no real title available?)
• A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
• Algorithmic method to obtain combinatorial structures associated with Leibniz algebras
• Another aspect of graph invariants depending on the path metric and an application in nanoscience
• Approximate eigensolution of Laplacian matrices for locally modified graph products
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Calculating the edge Wiener and edge Szeged indices of graphs
• Classification of Solvable Lie Algebras
• Classifying partial Latin rectangles
• Lie algebras of small dimension
• Non-associative algebras. I: Fundamental concepts and isotopy
• Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
• Parallel concepts in graph theory
• Small latin squares, quasigroups, and loops
• The set of autotopisms of partial Latin squares
• Wiener index of trees: Theory and applications

Cited in

(4)

• A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
• Enumerating partial Latin rectangles
• The isomorphism problem for graph magma algebras

Describes a project that uses

Uses Software

• pls.lib
• SINGULAR

This page was built for publication: Computation of isotopisms of algebras over finite fields by means of graph invariants

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