SearcharxivSearch

arXiv · 1407.3810

Structure theory for the group algebra of the symmetric group, with applications to polynomial identities for the octonions

Abstract

In part 1, we review the structure theory of $\mathbb{F} S_n$, the group algebra of the symmetric group $S_n$ over a field of characteristic 0. We define the images $\psi(E^\lambda_{ij})$ of the matrix units $E^\lambda_{ij}$ ($1 \le i, j \le d_\lambda$), where $d_\lambda$ is the number of standard tableaux of shape $\lambda$, and obtain an explicit construction of Young's isomorphism $\psi\colon \bigoplus_\lambda M_{d_\lambda}(\mathbb{F}) \to \mathbb{F} S_n$. We then present Clifton's algorithm for the construction of the representation matrices $R^\lambda(p) \in M_{d_\lambda}(\mathbb{F})$ for all $p \in S_n$, and obtain the reverse isomorphism $\phi\colon \mathbb{F} S_n \to \bigoplus_\lambda M_{d_\lambda}(\mathbb{F})$. In part 2, we apply the structure theory of $\mathbb{F} S_n$ to the study of multilinear polynomial identities of degree $n \le 7$ for the algebra $\mathbb{O}$ of octonions over a field of characteristic 0. We compare our results with earlier work of Racine, Hentzel & Peresi, and Shestakov & Zhukavets on the identities of degree $n \le 6$. We use computational linear algebra to verify that every identity in degree 7 is a consequence of the known identities of lower degrees: there are no new identities in degree 7. We conjecture that the known identities of degree $\le 6$ generate all octonion identities in characteristic 0.

Explore related subjects

Keep this discovery

BibTeXRIS

Murray Bremner, Sara Madariaga, Luiz A. Peresi. 2014-07-14. Structure theory for the group algebra of the symmetric group, with applications to polynomial identities for the octonions. https://arxiv.org/abs/1407.3810

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA