43 search results - page 1 / 9 » Polynomial-time theory of matrix groups |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
COMBINATORICS
1998
13 years 4 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
CPC
2006
13 years 4 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...