On the public citation graph

Computing Cartan Subalgebras of Lie Algebras

0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-6398-2openalex-snapshot
Introduction to Lie Algebras and Representation Theory
inferredcites →https://doi.org/10.1016/0024-3795(88)90210-8openalex-snapshot
On the identification of a Lie algebra given by its structure constants. I. Direct decompositions, levi decompositions, and nilradicals
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0747-7171(08)80017-xopenalex-snapshot
Computing the structure of finite algebras
inferredcites →https://doi.org/10.1090/dimacs/011/15openalex-snapshot
Computations in associative algebras
inferredcites →https://doi.org/10.1137/1.9781611971330openalex-snapshot
A Survey of Lie Groups and Lie Algebras with Applications and Computational Methods
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.2307/2008421openalex-snapshot
A Survey of Lie Groups and Lie Algebras with Applications and Computational Methods.
inferredcites →https://doi.org/10.2307/2345010openalex-snapshot
A Survey of Lie Groups and Lie Algebras with Applications and Computational Methods.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_14openalex-snapshot
Lie Algebras and the Security of Cryptosystems Based on Classical Varieties in Disguise
inferred← citeshttps://doi.org/10.1007/978-3-662-03891-8_5openalex-snapshot
Computations in Associative and Lie Algebras
inferred← citeshttps://doi.org/10.1007/s00037-016-0143-xopenalex-snapshot
Non-commutative Edmonds’ problem and matrix semi-invariants
inferred← citeshttps://doi.org/10.1007/s00037-018-0165-7openalex-snapshot
Constructive non-commutative rank computation is in deterministic polynomial time
inferred← citeshttps://doi.org/10.1007/s002000050066openalex-snapshot
Computing Levi Decompositions in Lie algebras
inferred← citeshttps://doi.org/10.1016/0010-4655(96)00021-5openalex-snapshot
Lie algebraic computation
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2009.04.013openalex-snapshot
An algorithm for Lang's Theorem
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.04.006openalex-snapshot
Generalized Wong sequences and their applications to Edmonds' problems
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.05.007openalex-snapshot
Computing with real Lie algebras: Real forms, Cartan decompositions, and Cartan subalgebras
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00016-9openalex-snapshot
Calculating the structure of a semisimple Lie algebra
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00007-9openalex-snapshot
Using cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00060-1openalex-snapshot
An algorithm for the decomposition of semisimple Lie algebras
inferred← citeshttps://doi.org/10.1016/s0924-6509(00)80029-xopenalex-snapshot
On nilpotency and solvability
inferred← citeshttps://doi.org/10.1016/s0924-6509(00)80030-6openalex-snapshot
Cartan subalgebras
inferred← citeshttps://doi.org/10.1016/s0924-6509(00)80037-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1137/1.9781611975031.152openalex-snapshot
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.87openalex-snapshot
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.