Pregled bibliografske jedinice broj: 304983
An algorithm for computing the full automorphism group of a matrix
An algorithm for computing the full automorphism group of a matrix // Journal of Computational Mathematics and Optimization, 3 (2007), 3; 153-162 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 304983 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
An algorithm for computing the full automorphism group of a matrix
Autori
Crnković, Dean
Izvornik
Journal of Computational Mathematics and Optimization (0972-9372) 3
(2007), 3;
153-162
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
algorithm; matrix; automorphism group; strong generating set
Sažetak
Two matrices A and B are isomorphic, if the matrix B is obtained by permuting the rows and the columns of the matrix A. The ordered pair of these permutations is called an isomorphism from A onto B. An isomorphism from the matrix A onto itself is called an automorphism of the matrix A. In this article we present an algorithm for computing the full automorphism group of a matrix.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
319-0000000-3037 - Blok dizajni, jako regularni grafovi i srodne kombinatoričke strukture (Crnković, Dean, MZOS ) ( CroRIS)
Ustanove:
Filozofski fakultet, Rijeka
Profili:
Dean Crnković
(autor)
Citiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- Mathematical Reviews
- Zentralblatt MATH
