James B. Wilson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
James B. Wilson has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Peter A. Brooksbank
Bucknell University
7 shared publications - Joshua Maglione
Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany
3 shared publications - Heiko Dietrich
Monash University
2 shared publications - Joshua Maglione
School of Mathematical and Statistical Sciences University of Galway Galway Ireland
2 shared publications - Joshua Maglione2 shared publications
- Mark L. Lewis
Department of Mathematical Sciences, Kent State University, Kent, USA
2 shared publications
Latest Publications
- Open Access
Isomorphism invariant metrics
Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times \mathtt{C}_0 \to [0,\infty]$ with the property that $x\cong y$ implies $d(x,y)=0$. We also give a canonical construction that associates to each isomorphism invariant a pseudo-metric satisfying that condition. This guarantees a large source of isomorphism invariant pseudo-metrics. We examine such pseudo-metrics for invariants in various categories.Open AccessIsomorphism invariant metrics
Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times \mathtt{C}_0 \to [0,\infty]$ with the property that $x\cong y$ implies $d(x,y)=0$. We also give a canonical construction that associates to each isomorphism invariant a pseudo-metric satisfying that condition. This guarantees a large source of isomorphism invariant pseudo-metrics. We examine such pseudo-metrics for invariants in various categories. - 27 April 2022
- Published by Elsevier in Journal of Algebra
- Vol. 604, 790-807
Tensor isomorphism by conjugacy of Lie algebras
- 27 April 2022
- Published by Elsevier in Journal of Algebra
- Vol. 604, 790-807
Tensor isomorphism by conjugacy of Lie algebras
- Open Access
Tensor Isomorphism by conjugacy of Lie algebras
We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable we give a polynomial-time algorithm to solve a generalization of module isomorphism for a common class of Lie modules. As a consequence, we show that isomorphism testing is in polynomial time for tensors whose derivation algebras are classical Lie algebras and whose densor spaces are 1-dimensional. The method has been implemented in the Magma computer algebra system.
Open AccessTensor Isomorphism by conjugacy of Lie algebras
We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable we give a polynomial-time algorithm to solve a generalization of module isomorphism for a common class of Lie modules. As a consequence, we show that isomorphism testing is in polynomial time for tensors whose derivation algebras are classical Lie algebras and whose densor spaces are 1-dimensional. The method has been implemented in the Magma computer algebra system.
- 1 February 2022
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 54 (1) , 213-232
Subgroups of simple groups are as diverse as possible
- 1 February 2022
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 54 (1) , 213-232
Subgroups of simple groups are as diverse as possible
- Open Access
Polynomial-time isomorphism testing of groups of most finite orders
[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$ can be done in time polynomial in $\log n$. We also prove that for a dense set of orders $n$ with given prime factors, one can test isomorphism for coprime meta-cyclic groups of black-box type of order $n$ in time polynomial in $\log n$. Prior methods for these two classes of groups have running times exponential in $\log n$.Open AccessPolynomial-time isomorphism testing of groups of most finite orders
[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$ can be done in time polynomial in $\log n$. We also prove that for a dense set of orders $n$ with given prime factors, one can test isomorphism for coprime meta-cyclic groups of black-box type of order $n$ in time polynomial in $\log n$. Prior methods for these two classes of groups have running times exponential in $\log n$. - Open Access
Group isomorphism is nearly-linear time for most orders
We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic groups of order $n$. This improves significantly over the general $n^{O(\log n)}$-time complexity and shows that group isomorphism can be tested efficiently for almost all group orders $n$. We also show that in time $O(n^2 (\log n)^c)$ it can be decided whether an $n\times n$ multiplication table describes a group; this improves over the known $O(n^3)$ complexity. Our complexities are calculated for a deterministic multi-tape Turing machine model. We give the implications to a RAM model in the promise hierarchy as well.Open AccessGroup isomorphism is nearly-linear time for most orders
We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic groups of order $n$. This improves significantly over the general $n^{O(\log n)}$-time complexity and shows that group isomorphism can be tested efficiently for almost all group orders $n$. We also show that in time $O(n^2 (\log n)^c)$ it can be decided whether an $n\times n$ multiplication table describes a group; this improves over the known $O(n^3)$ complexity. Our complexities are calculated for a deterministic multi-tape Turing machine model. We give the implications to a RAM model in the promise hierarchy as well. - Open Access
Subgroups of simple groups are as diverse as possible
For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$ and characteristic $p$. If $r\neq 1$, $L\not\cong {^2 B_2}(2^{1+2m})$, then there are constants $c,d$, dependent on the Lie type, such that as $re$ grows $$p^{(c-o(1))r^4e^2}\leq\sigma_{\iota}(L_r(p^e))\leq\sigma(L_r(p^e)) \leq p^{(d+o(1))r^4e^2}.$$ For type $A$, $c=d=1/64$. For other classical groups $1/64\leq c\leq d\leq 1/4$. For exceptional and twisted groups $1/2^{100}\leq c\leq d\leq 1/4$. Furthermore, $$2^{(1/36-o(1))k^2)}\leq\sigma_{\iota}(\mathrm{Alt}_k)\leq \sigma(\mathrm{Alt}_k)\leq 24^{(1/6+o(1))k^2}.$$ For abelian and sporadic simple groups $G$, $\sigma_{\iota}(G),\sigma(G)\in O(1)$. In general these bounds are best possible amongst groups of the same orders. Thus with the exception of finite simple groups with bounded ranks and field degrees, the subgroups of finite simple groups are as diverse as possible.Open AccessSubgroups of simple groups are as diverse as possible
For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$ and characteristic $p$. If $r\neq 1$, $L\not\cong {^2 B_2}(2^{1+2m})$, then there are constants $c,d$, dependent on the Lie type, such that as $re$ grows $$p^{(c-o(1))r^4e^2}\leq\sigma_{\iota}(L_r(p^e))\leq\sigma(L_r(p^e)) \leq p^{(d+o(1))r^4e^2}.$$ For type $A$, $c=d=1/64$. For other classical groups $1/64\leq c\leq d\leq 1/4$. For exceptional and twisted groups $1/2^{100}\leq c\leq d\leq 1/4$. Furthermore, $$2^{(1/36-o(1))k^2)}\leq\sigma_{\iota}(\mathrm{Alt}_k)\leq \sigma(\mathrm{Alt}_k)\leq 24^{(1/6+o(1))k^2}.$$ For abelian and sporadic simple groups $G$, $\sigma_{\iota}(G),\sigma(G)\in O(1)$. In general these bounds are best possible amongst groups of the same orders. Thus with the exception of finite simple groups with bounded ranks and field degrees, the subgroups of finite simple groups are as diverse as possible. - Open Access
A spectral theory for transverse tensor operators
Tensors are multiway arrays of data, and transverse operators are the operators that change the frame of reference. We develop the spectral theory of transverse tensor operators and apply it to problems closely related to classifying quantum states of matter, isomorphism in algebra, clustering in data, and the design of high performance tensor type-systems. We prove the existence and uniqueness of the optimally-compressed tensor product spaces over algebras, called \emph{densors}. This gives structural insights for tensors and improves how we recognize tensors in arbitrary reference frames. Using work of Eisenbud--Sturmfels on binomial ideals, we classify the maximal groups and categories of transverse operators, leading us to general tensor data types and categorical tensor decompositions, amenable to theorems like Jordan--H\"older and Krull--Schmidt. All categorical tensor substructure is detected by transverse operators whose spectra contain a Stanley--Reisner ideal, which can be analyzed with combinatorial and geometrical tools via their simplicial complexes. Underpinning this is a ternary Galois correspondence between tensor spaces, multivariable polynomial ideals, and transverse operators. This correspondence can be computed in polynomial time. We give an implementation in the computer algebra system \textsf{Magma}.
Open AccessA spectral theory for transverse tensor operators
Tensors are multiway arrays of data, and transverse operators are the operators that change the frame of reference. We develop the spectral theory of transverse tensor operators and apply it to problems closely related to classifying quantum states of matter, isomorphism in algebra, clustering in data, and the design of high performance tensor type-systems. We prove the existence and uniqueness of the optimally-compressed tensor product spaces over algebras, called \emph{densors}. This gives structural insights for tensors and improves how we recognize tensors in arbitrary reference frames. Using work of Eisenbud--Sturmfels on binomial ideals, we classify the maximal groups and categories of transverse operators, leading us to general tensor data types and categorical tensor decompositions, amenable to theorems like Jordan--H\"older and Krull--Schmidt. All categorical tensor substructure is detected by transverse operators whose spectra contain a Stanley--Reisner ideal, which can be analyzed with combinatorial and geometrical tools via their simplicial complexes. Underpinning this is a ternary Galois correspondence between tensor spaces, multivariable polynomial ideals, and transverse operators. This correspondence can be computed in polynomial time. We give an implementation in the computer algebra system \textsf{Magma}.
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 43-63
Exact sequences of inner automorphisms of tensors
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 43-63
Exact sequences of inner automorphisms of tensors
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 174-197
Isomorphism testing of groups of cube-free order
- 1 March 2020
- Published by Elsevier in Journal of Algebra
- Vol. 545, 174-197
Isomorphism testing of groups of cube-free order