Computation of isotopisms of algebras over finite fields by means of graph invariants
DOI10.1016/j.cam.2016.09.002zbMath1355.05125arXiv1609.01061OpenAlexW2518425107MaRDI QIDQ507895
A. M. Pacheco, Juan Núñez Valdés, Raúl M. Falcón, Óscar J. Falcón, María Trinidad 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
Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying partial Latin rectangles
- The set of autotopisms of partial Latin squares
- Calculating the edge Wiener and edge Szeged indices of graphs
- 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
- Parallel concepts in graph theory
- Algorithmic method to obtain combinatorial structures associated with Leibniz algebras
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- 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
- Non-associative algebras. I: Fundamental concepts and isotopy
- A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
- Classification of Solvable Lie Algebras
- Small latin squares, quasigroups, and loops
- Wiener index of trees: Theory and applications
This page was built for publication: Computation of isotopisms of algebras over finite fields by means of graph invariants
