On the public citation graph
Decompositions of algebras over ? and ?
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_12openalex-snapshot
Computing in Algebraic Extensions
inferredcites →https://doi.org/10.1007/bf01272075openalex-snapshot
Algorithmic properties of maximal orders in simple algebras over Q
inferredcites →https://doi.org/10.1007/bf01272520openalex-snapshot
Decomposition of algebras over finite fields and number fields
inferredcites →https://doi.org/10.1016/0041-5553(64)90132-6openalex-snapshot
Representation theory of finite groups and associative algebras
inferredcites →https://doi.org/10.1016/0196-6774(88)90014-4openalex-snapshot
Zero divisors in quaternion algebras
inferredcites →https://doi.org/10.1063/1.1664689openalex-snapshot
New Methods for Reduction of Group Representations. II
inferredcites →https://doi.org/10.1063/1.1664785openalex-snapshot
New Methods for Reduction of Group Representations. IV
inferredcites →https://doi.org/10.1063/1.1665028openalex-snapshot
New Methods for Reduction of Group Representations. III
inferredcites →https://doi.org/10.1063/1.1704141openalex-snapshot
New Methods for Reduction of Group Representations Using an Extension of Schur's Lemma
inferredcites →https://doi.org/10.1090/chel/356openalex-snapshot
Representation Theory of Finite Groups and Associative Algebras
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035925-1openalex-snapshot
Computing irreducible representations of finite groups
inferredcites →https://doi.org/10.1137/0214015openalex-snapshot
Factoring Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/1089310.1089312openalex-snapshot
Computer algebra symbolic and algebraic computation
inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot
Polynomial time solutions of some problems of computational algebra
inferredcites →https://doi.org/10.1145/355705.355710openalex-snapshot
An Exact Method for Finding the Roots of a Complex Polynomial
inferredcites →https://doi.org/10.1145/800204.806285openalex-snapshot
Numerical methods for reduction of group representations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2001.0485openalex-snapshot
Computing Homomorphisms Between HolonomicD-modules
inferred← citeshttps://doi.org/10.1007/bf01225642openalex-snapshot
Graph algebras and the graph isomorphism problem
inferred← citeshttps://doi.org/10.1007/bf01272075openalex-snapshot
Algorithmic properties of maximal orders in simple algebras over Q
inferred← citeshttps://doi.org/10.1007/s00200-021-00529-0openalex-snapshot
An identification system based on the explicit isomorphism problem
inferred← citeshttps://doi.org/10.1007/s10208-020-09465-wopenalex-snapshot
Noncommutative Polynomials Describing Convex Sets
inferred← citeshttps://doi.org/10.1007/s10958-017-3371-yopenalex-snapshot
Cryptographic Algorithms on Groups and Algebras
inferred← citeshttps://doi.org/10.1007/s40993-022-00380-3openalex-snapshot
Explicit isomorphisms of quaternion algebras over quadratic global fields
inferred← citeshttps://doi.org/10.1016/j.aim.2018.04.007openalex-snapshot
Geometry of free loci and factorization of noncommutative polynomials
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.09.031openalex-snapshot
Computing generators of the unit group of an integral abelian group ring
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.03.033openalex-snapshot
A note on locality of algebras
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/s0924-6509(00)80031-8openalex-snapshot
Lie algebras with non-degenerate Killing form
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00087openalex-snapshot
Learning sums of powers of low-degree polynomials in the non-degenerate case
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.1137/19m1299128openalex-snapshot
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
inferred← citeshttps://doi.org/10.1142/s1230161219500100openalex-snapshot
Reducibility Criteria and a Construction Method for the Analysis of Open Quantum Systems
inferred← citeshttps://doi.org/10.1142/s1793557122501418openalex-snapshot
Algebraic reduction methods and their applications to matrix continued fractions
inferred← citeshttps://doi.org/10.1145/258726.258751openalex-snapshot
Polynomial time algorithms for modules over finite dimensional algebras
inferred← citeshttps://doi.org/10.1145/345542.345620openalex-snapshot
Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03950openalex-snapshot
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12244openalex-snapshot
Certifying Numerical Decompositions of Compact Group Representations
inferred← citeshttps://doi.org/10.7169/facm/2100openalex-snapshot
Some algebraic methods for analysing matrix continued fractions
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.