88 search results - page 2 / 18 » Computing automorphisms of semigroups |
CC
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
MFCS
2000
Springer
13 years 9 months ago
2000
Springer
We show that AI
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
In this note we prove the uniqueness of the tight spherical 7-design in R23 consisting of 4600 vectors and with automorphism group 2 ? Co2 as well as the uniqueness of the tight s...
COMBINATORICS
2006
13 years 5 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...