Arne Storjohann
- 1.AUGOT, D., AND CAMION, P. Frobenius form and cyclic vectors. C.-R.-Acad.-Sci.-Paris-Ser.-I-Math. 318, 2 (1994), 183-188.Google Scholar
- 2.BAUR, W., AND STRASSEN, V. The complexity of partial derivatives. Theoretical Computer Science 22, 3 (1983), 317--330.Google ScholarCross Ref
- 3.COPPERSMITH, D., AND WINOGRAD, S. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 (1990), 251-280. Google ScholarDigital Library
- 4.GIESBRECHT, M. Nearly Optimal Algorithms for Canonical Matrix Forms. PhD thesis, University of Toronto, 1993. Google ScholarDigital Library
- 5.GIESBRECHT, M. Nearly optimal algorithms for canonical matrix forms. SIAM Journal of Computing 2~ (1995), 948-969. Google ScholarDigital Library
- 6.LUNEBURG, H. On Rational Normal Form of Endomorphisms: a Primer to Constructive Algebra. Wissenschaftsverlag, Mannheim, 1987.Google Scholar
- 7.NEWMAN, M. Integral Matrices. Academic Press, 1972.Google Scholar
- 8.OZELLO, P. Calcul Exact Des Formes De Jordan et de Frobenius d'une Matrice. PhD thesis, Universit~ Scientifique Technologique et Medicale de Grenoble, 1987.Google Scholar
- 9.STEEL, A. A new algorithm for the computation of canonical forms of matrices over fields. Journal of Symbolic Computation 2~ (1997), 409--432. Google ScholarDigital Library
- 10.STORJoHANN, A. Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra and its Applications (1998). To appear.Google Scholar
Index Terms
- An O(n3) algorithm for the Frobenius normal form
Recommendations
Normal edge-transitive Cayley graphs of Frobenius groups
A Cayley graph for a group G is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the holomorph of G [the normaliser of a regular copy of G in $${{\mathrm{Sym}}}(G)$$Sym(G)]. We complete the classification of ...
Graphical Frobenius representations
A Frobenius group is a transitive permutation group that is not regular and such that only the identity fixes more than one point. A graphical Frobenius representation (GFR) of a Frobenius group G is a graph whose automorphism group, as a group of ...
Frobenius maps
A graph is called Frobenius if it is a connected orbital regular graph of a Frobenius group. A Frobenius map is a regular Cayley map whose underlying graph is Frobenius. In this paper, we show that almost all low-rank Frobenius graphs admit regular ...
Comments