SearcharxivSearch

arXiv · 1907.07711

On the Galois correspondence for Hopf Galois structures arising from finite radical algebras and Zappa-Sz\'ep products

Abstract

Let $L/K$ be a $G$-Galois extension of fields with an $H$-Hopf Galois structure of type $N$. We study the ratio $GC(G, N)$, which is the number of intermediate fields $E$ with $K \subseteq E \subseteq L$ that are in the image of the Galois correspondence for the $H$-Hopf Galois structure on $L/K$, divided by the number of intermediate fields. By Galois descent, $L \otimes_K H = LN$ where $N$ is a $G$-invariant regular subgroup of $\mathrm{Perm}(G)$, and then $GC(G, N)$ is the number of $G$-invariant subgroups of $N$, divided by the number of subgroups of $G$. We look at the Galois correspondence ratio for a Hopf Galois structure by translating the problem into counting certain subgroups of the corresponding skew brace. We look at skew braces arising from finite radical algebras $A$ and from Zappa-Sz\'ep products of finite groups, and in particular when $A^3 = 0$ or the Zappa-Sz\'ep product is a semidirect product, in which cases the corresponding skew brace is a bi-skew brace, that is, a set $G$ with two group operations $\circ$ and $\star$ in such a way that $G$ is a skew brace with either group structure acting as the additive group of the skew brace. We obtain the Galois correspondence ratio for several examples. In particular, if $(G, \circ, \star)$ is a bi-skew brace of squarefree order $2m$ where $(G, \circ) \cong Z_{2m}$ is cyclic and $(G, \star) = D_m$ is dihedral, then for large $m$, $GC(Z_{2m},D_m), $ is close to 1/2 while $GC(D_m, Z_{2m})$ is near 0.

Explore related subjects

Keep this discovery

BibTeXRIS

Lindsay N. Childs. 2019-07-17. On the Galois correspondence for Hopf Galois structures arising from finite radical algebras and Zappa-Sz\'ep products. https://arxiv.org/abs/1907.07711

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