A computational approach to almost-inner derivations

Heiko Dietrich; Willem A. de Graaf

REVIEW

A computational approach to almost-inner derivations

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.05905 v1 pith:2OPUH3TQ submitted 2024-03-09 math.RA

A computational approach to almost-inner derivations

Heiko Dietrich , Willem A. de Graaf This is my paper

classification math.RA

keywords derivationsalgebraalmost-innerapproachcomputationalanswersconstantdetermine

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We present a computational approach to determine the space of almost-inner derivations of a finite dimensional Lie algebra given by a structure constant table. We also present an example of a Lie algebra for which the quotient algebra of the almost-inner derivations modulo the inner derivations is non-abelian. This answers a question of Kunyavskii and Ostapenko.

A computational approach to almost-inner derivations

discussion (0)