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

DOI10.1016/J.CAM.2016.09.002zbMATH Open1355.05125arXiv1609.01061OpenAlexW2518425107MaRDI QIDQ507895FDOQ507895

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)

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.

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Wiener index of trees: Theory and applications
• Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
• Classification of Solvable Lie Algebras
• Title not available (Why is that?)
• Parallel concepts in graph theory
• 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
• Lie algebras of small dimension
• Small latin squares, quasigroups, and loops
• A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
• Classifying partial Latin rectangles
• The set of autotopisms of partial Latin squares
• Another aspect of graph invariants depending on the path metric and an application in nanoscience
• Non-associative algebras. I: Fundamental concepts and isotopy
• Algorithmic method to obtain combinatorial structures associated with Leibniz algebras
• Approximate eigensolution of Laplacian matrices for locally modified graph products

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

Uses Software

• SINGULAR
• pls.lib

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)