On the public citation graph

Decomposition of algebras overF q (X 1,...,X m )

0 signed · 18 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/3-540-51084-2_29openalex-snapshot

Decomposition of algebras

inferredcites →https://doi.org/10.1007/bf01272520openalex-snapshot

Decomposition of algebras over finite fields and number fields

inferredcites →https://doi.org/10.1016/b978-0-12-741245-0.50007-5openalex-snapshot

Computational Complexity

inferredcites →https://doi.org/10.1016/s0747-7171(08)80017-xopenalex-snapshot

Computing the structure of finite algebras

inferredcites →https://doi.org/10.1017/cbo9781107340749openalex-snapshot

Field Extensions and Galois Theory

inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot

Factoring polynomials over large finite fields

inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot

Polynomial time solutions of some problems of computational algebra

inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot

Fast Probabilistic Algorithms for Verification of Polynomial Identities

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-662-03891-8_5openalex-snapshot

Computations in Associative and Lie Algebras

inferred← citeshttps://doi.org/10.1007/bf02772615openalex-snapshot

Deciding finiteness for matrix semigroups over function fields over finite fields

inferred← citeshttps://doi.org/10.1007/s10208-016-9336-6openalex-snapshot

Algorithms for Commutative Algebras Over the Rational Numbers

inferred← citeshttps://doi.org/10.1007/s10208-017-9343-2openalex-snapshot

Computing Explicit Isomorphisms with Full Matrix Algebras over $$\mathbb {F}_q(x)$$ F q ( x )

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.jalgebra.2015.03.033openalex-snapshot

A note on locality of algebras

inferred← citeshttps://doi.org/10.1016/j.jsc.2018.04.018openalex-snapshot

Computing the bound of an Ore polynomial. Applications to factorization

inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00010-8openalex-snapshot

Finding the radical of an algebra of linear transformations

inferred← citeshttps://doi.org/10.1016/s0924-6509(00)80037-9openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.48550/arxiv.1508.07755openalex-snapshot

Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$

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.