SearcharxivSearch

arXiv · 2401.14648

A Solomon Mackey formula for graded bialgebras

Abstract

Given a graded bialgebra $H$, we let $\Delta^{\left[ k\right] }:H\rightarrow H^{\otimes k}$ and $m^{\left[ k\right] }:H^{\otimes k}\rightarrow H$ be its iterated (co)multiplications for all $k\in\mathbb{N}$. For any $k$-tuple $\alpha=\left( \alpha_{1},\alpha_{2},\ldots,\alpha_{k}\right) \in\mathbb{N}^{k}$ of nonnegative integers, and any permutation $\sigma$ of $\left\{ 1,2,\ldots,k\right\} $, we consider the map $p_{\alpha,\sigma}:=m^{\left[ k\right] }\circ P_{\alpha}\circ\sigma^{-1}\circ\Delta^{\left[ k\right] }:H\rightarrow H$, where $P_{\alpha}$ denotes the projection of $H^{\otimes k}$ onto its multigraded component $H_{\alpha_{1}}\otimes H_{\alpha_{2}}\otimes\cdots\otimes H_{\alpha_{k}}$, and where $\sigma^{-1}:H\rightarrow H$ permutes the tensor factors. We prove formulas for the composition $p_{\alpha,\sigma}\circ p_{\beta,\tau}$ and the convolution $p_{\alpha,\sigma}\star p_{\beta,\tau}$ of two such maps. When $H$ is cocommutative, these generalize Patras's 1994 results (which, in turn, generalize Solomon's Mackey formula). We also construct a combinatorial Hopf algebra $\operatorname*{PNSym}$ ("permuted noncommutative symmetric functions") that governs the maps $p_{\alpha,\sigma}$ for arbitrary connected graded bialgebras $H$ in the same way as the well-known $\operatorname*{NSym}$ governs them in the cocommutative case. We end by outlining an application to checking identities for connected graded Hopf algebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darij Grinberg. 2024-01-26. A Solomon Mackey formula for graded bialgebras. https://arxiv.org/abs/2401.14648

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