Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Kantor, W. M."'
We survey the area of strongly regular graphs satisfying the 4-vertex condition and find several new families. We describe a switching operation on collinearity graphs of polar spaces that produces cospectral graphs. The obtained graphs satisfy the 4
Externí odkaz:
http://arxiv.org/abs/2107.00076
Autor:
Kantor, W. M.
New types of maximal symplectic partial spreads are constructed.
Externí odkaz:
http://arxiv.org/abs/1601.04194
Autor:
Kantor, W. M.
Moderately large numbers of transitive elliptic spreads are constructed in characteristic $2$ and dimension $\equiv $ 2 (mod 4).
Externí odkaz:
http://arxiv.org/abs/1512.00861
Autor:
Kantor, W. M., Kassabov, M.
A deterministic polynomial-time algorithm constructs an isomorphism between ${\rm PGL}(2,2^e)$ and a black box group to which it is isomorphic.
Comment: To appear in J. Algebra
Comment: To appear in J. Algebra
Externí odkaz:
http://arxiv.org/abs/1309.3715
Autor:
Kantor, W. M., Magaard, K.
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank $>1$, other than any $^2F_4(q)$, over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism. In view of
Externí odkaz:
http://arxiv.org/abs/1112.3000
Autor:
Kantor, W. M., Shult, E. E.
Results are proved indicating that the Veronese map v_d often increases independence of both sets of points and sets of subspaces. For example, any d+1 Veronesean points of degree d are independent. Similarly, the dth power map on the space of linear
Externí odkaz:
http://arxiv.org/abs/1109.0652
A subset S of a finite group G invariably generates G if G = for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response to a ques
Externí odkaz:
http://arxiv.org/abs/1010.5722
If a finite group G has a presentation with d generators and r relations, it is well-known that r - d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition for profic
Externí odkaz:
http://arxiv.org/abs/0905.0256
All nonabelian finite simple groups of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, have presentations with at most $80 $ relations and bit-length $O(\log n +\log q)$. Moreover, $A_n$ and $S_n$ h
Externí odkaz:
http://arxiv.org/abs/0804.1396