JWJames B. Wilson

James B. Wilson

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


James B. Wilson has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Intersecting two classical groups

    by Peter A. Brooksbank, James B. Wilson


  • Open Access

    Computing isometry groups of Hermitian maps

    by Peter Brooksbank, James Wilson

    A theorem is proved on the structure of the group of isometries of a Hermitian map b : V × V → W b\colon V\times V\to W , where V V and W W are vector spaces over a finite field of odd order. Also a Las Vegas polynomial-time algorithm is presented which, given a Hermitian map, finds generators for, and determines the structure of its isometry group. The algorithm can be adapted to construct the intersection over a set of classical subgroups of GL ⁡ ( V ) \operatorname {GL}(V) , giving rise to the first polynomial-time solution of this old problem. The approach yields new algorithmic tools for algebras with involution, which in turn have applications to other computational problems of interest. Implementations of the various algorithms in the Magma system demonstrate their practicability.


  • Open Access

    Division, adjoints, and dualities of bilinear maps

    by James B. Wilson

    The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the adjoint category is not a module category but nevertheless it is suitably familiar. The universal properties have geometric perspectives. For example, products are orthogonal sums. The bilinear division maps are the simple bimaps with respect to nondegenerate adjoint-morphisms. That formalizes the understanding that the atoms of linear geometries are algebraic objects with no zero-divisors. Adjoint-isomorphism coincides with principal isotopism; hence, nonassociative division rings can be studied within this framework. This also corrects an error in an earlier pre-print; see Remark 2.11.

  • Open Access

    Optimal algorithms of Gram-Schmidt type

    by James B. Wilson

    Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very simple implementation. Next, that algorithm is adapted in two new directions. One is an optimal sequential algorithm whose complexity matches the complexity of matrix multiplication. The other is a parallel NC algorithm with similar complexity.

  • Open Access

    Finding direct product decompositions in polynomial time

    by James B. Wilson

    A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and commutative rings to characterize direct products of p-groups of class 2 and reduces general groups to p-groups using group varieties. The methods apply to quotients of permutation groups and operator groups as well.

  • Finding central decompositions of p-groups

    by James B. Wilson

    Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of finite *-rings and also the Las Vegas C-MeatAxe. When p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The methods introduce new group isomorphism invariants including new characteristic subgroups.Comment: 28 page


  • Open Access

    Finding central decompositions of p-groups

    by James B. Wilson

    Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of finite *-rings and also the Las Vegas C-MeatAxe. When p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The methods introduce new group isomorphism invariants including new characteristic subgroups.