|
Search: id:A053854
|
|
|
| A053854 |
|
Number of n X n matrices over GF(3) of order dividing 9, i.e. the number of solutions to X^9=I in GL(n,3)). |
|
+0
2
|
|
| 1, 9, 729, 531441, 3486784401, 205891132094649, 109418989131512359209, 523347633027360537213511521, 22528399544939174411840147874772641
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Is this the same sequence (apart from the initial term) as A053764? - Philippe DELEHAM, Dec 09 2007
Comment from M. F. Hasler (maximilian.hasler(AT)gmail.com), Oct 14 2008: (Start)
X^9 = I <=> I - X^9 = 0 <=> (I - X)^9 = 0 in GF(3). So to any solution of the first equation corresponds a solution X' = I-X of the other equation and vice versa. On the other hand, from considerations about the matrix rank (e.g. resoning in Jordan basis) it is known that to check for nilpotency it is sufficient to go up to an exponent equal to the size of the matrix.
Thus by going out to the 9-th power one finds all nilpotent matrices for sizes <= 9 X 9. Since A053854 is only given up to n=9, we can't see if A053764(10) is strictly bigger than A053854(10), which seems very likely since from then on there should be more matrices that satisfy A^10=0 than there are matrices satisfying A^9=0. (End)
|
|
REFERENCES
|
V. Jovovic, The cycle index polynomials of some classical groups, Belgrade, 1995, unpublished.
Kent E. Morrison, Integer Sequences and Matrices Over Finite Fields, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.
|
|
CROSSREFS
|
Cf. A053774.
Sequence in context: A013714 A069034 A053847 this_sequence A053764 A122251 A015481
Adjacent sequences: A053851 A053852 A053853 this_sequence A053855 A053856 A053857
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 28 2000
|
|
|
Search completed in 0.002 seconds
|
