SearcharxivSearch

arXiv · 1907.08768

On Peterson's open problem and representations of the general linear groups

Abstract

Fix $\mathbb Z/2$ is the prime field of two elements and write $\mathcal A_2$ for the mod $2$ Steenrod algebra. Denote by $GL_d:= GL(d, \mathbb Z/2)$ the general linear group of rank $d$ over $\mathbb Z/2$ and by $\mathscr P_d$ the polynomial algebra $\mathbb Z/2[x_1, x_2, \ldots, x_d]$ as a connected unstable $\mathcal A_2$-module on $d$ generators of degree one. We study the Peterson "hit problem" of finding the minimal set of $\mathcal A_2$-generators for $\mathscr P_d.$ It is equivalent to determining a $\mathbb Z/2$-basis for the space of "cohits" $Q\mathscr P_d := \mathbb Z/2\otimes_{\mathcal A_2} \mathscr P_d \cong \mathscr P_d/\mathcal A_2^+\mathscr P_d.$ This $Q\mathscr P_d$ is also a representation of $GL_d$ over $\mathbb Z/2.$ The problem for $d= 5$ is not yet completely solved, and unknown in general. In this work, we give an explicit solution to the hit problem of five variables in the generic degree $n = r(2^t -1) + 2^ts$ with $r = d = 5,\ s =8$ and $t$ an arbitrary non-negative integer. An application of this study to the cases $t = 0$ and $t = 1$ shows that the Singer algebraic transfer of rank $5$ is an isomorphism in the bidegrees $(5, 5+(13.2^{0} - 5))$ and $(5, 5+(13.2^{1} - 5)).$ Moreover, the result when $t\geq 2$ was also discussed. Here, the Singer transfer of rank $d$ is a $\mathbb Z/2$-algebra homomorphism from $GL_d$-coinvariants of certain subspaces of $Q\mathscr P_d$ to the cohomology groups of the Steenrod algebra, ${\rm Ext}_{\mathcal A_2}^{d, d+*}(\mathbb Z/2, \mathbb Z/2).$ It is one of the useful tools for studying mysterious Ext groups and the Kervaire invariant one problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dang Vo Phuc. 2019-07-20. On Peterson's open problem and representations of the general linear groups. https://doi.org/10.4134/jkms.j200219

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