On the public citation graph
Generating the ring of matrix invariants
0 signed · 22 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.1016/0001-8708(76)90027-xopenalex-snapshot
The invariant theory of n × n matrices
inferredcites →https://doi.org/10.1070/im1974v008n04abeh002126openalex-snapshot
TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO
inferredcites →https://doi.org/10.1090/conm/013/685937openalex-snapshot
The polynomial identities of matrices
inferredcites →https://doi.org/10.2307/2311961openalex-snapshot
Solved Problems: Gamma and Beta Functions, Legendre Polynomials, Bessel Functions.
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-642-40328-6_37openalex-snapshot
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1007/s00031-020-09559-3openalex-snapshot
WEYL’S POLARIZATION THEOREM IN POSITIVE CHARACTERISTIC
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/s10208-019-09417-zopenalex-snapshot
Operator Scaling: Theory and Applications
inferred← citeshttps://doi.org/10.1016/j.aim.2017.01.018openalex-snapshot
Polynomial degree bounds for matrix semi-invariants
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2017.06.035openalex-snapshot
Generating invariant rings of quivers in arbitrary characteristic
inferred← citeshttps://doi.org/10.1016/j.jpaa.2017.12.007openalex-snapshot
Degree bounds for semi-invariant rings of quivers
inferred← citeshttps://doi.org/10.1080/03081089608818470openalex-snapshot
Concomitants etp-uplets de matrices 2 × 2
inferred← citeshttps://doi.org/10.1090/jams/864openalex-snapshot
Geometric complexity theory V: Efficient algorithms for Noether normalization
inferred← citeshttps://doi.org/10.1090/s0002-9947-1990-0958897-0openalex-snapshot
Semisimple Representations of Quivers
inferred← citeshttps://doi.org/10.1109/focs.2012.15openalex-snapshot
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
inferred← citeshttps://doi.org/10.1109/focs.2016.95openalex-snapshot
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00027openalex-snapshot
The minimal canonical form of a tensor network
inferred← citeshttps://doi.org/10.2140/ant.2018.12.1233openalex-snapshot
Polynomial bound for the nilpotency index of finitely generated nil algebras
inferred← citeshttps://doi.org/10.2140/ant.2020.14.2791openalex-snapshot
Algorithms for orbit closure separation for invariants and semi-invariants of matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2209.14358openalex-snapshot
The minimal canonical form of a tensor network
inferred← citeshttps://doi.org/10.48550/arxiv.math/0506614openalex-snapshot
Computing with matrix invariants
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.