On the public citation graph

Finding maximal orders in semisimple algebras over Q

https://doi.org/10.1007/bf01271370
0 signed · 39 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.1002/j.1538-7305.1967.tb03174.xopenalex-snapshot
Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1006/jagm.1994.1002openalex-snapshot
A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
inferredcites →https://doi.org/10.1007/978-3-0348-5821-2_10openalex-snapshot
Ein Algorithmus zur Berechnung einer Minimalbasis über Gegebener Ordnung
inferredcites →https://doi.org/10.1007/bf01272075openalex-snapshot
Algorithmic properties of maximal orders in simple algebras over Q
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.1090/s0002-9939-1971-0272807-7openalex-snapshot
Two Remarks About Hereditary Orders
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0151489-9openalex-snapshot
Hereditary Orders
inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot
Polynomial time solutions of some problems of computational algebra

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-1-4614-7488-3_10openalex-snapshot
Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_15openalex-snapshot
Improved Torsion-Point Attacks on SIDH Variants
inferred← citeshttps://doi.org/10.1007/978-3-032-35398-6_14openalex-snapshot
On the Conversion of Module Representations for Higher Dimensional Supersingular Isogenies
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/0012-365x(95)00135-jopenalex-snapshot
Lattice basis reduction for indefinite forms and an application
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2005.06.022openalex-snapshot
A Lie algebra method for rational parametrization of Severi–Brauer surfaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.01.008openalex-snapshot
Splitting full matrix algebras over algebraic number fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2017.07.015openalex-snapshot
Orders of quaternion algebras with involution
inferred← citeshttps://doi.org/10.1016/j.jpaa.2014.04.025openalex-snapshot
Lattices from maximal orders into quaternion algebras
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.106221openalex-snapshot
Algebraic construction of lattices via maximal quaternion orders
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.01.001openalex-snapshot
Trivializing a central simple algebra of degree 4 over the rational numbers
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.08.002openalex-snapshot
Splitting quaternion algebras over quadratic number fields
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00071-3openalex-snapshot
Efficient decomposition of separable algebras
inferred← citeshttps://doi.org/10.1017/fms.2022.74openalex-snapshot
Computation of lattice isomorphisms and the integral matrix similarity problem
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02858-5openalex-snapshot
Explicit 𝑛-descent on elliptic curves III. Algorithms
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00760-0openalex-snapshot
Solvability of norm equations over cyclic number fields of prime degree
inferred← citeshttps://doi.org/10.1109/isit.2006.261720openalex-snapshot
Optimal Matrix Lattices for MIMO Codes from Division Algebras
inferred← citeshttps://doi.org/10.1109/isita.2008.4895634openalex-snapshot
Maximal orders in space-time coding: Construction and decoding
inferred← citeshttps://doi.org/10.1109/tit.2008.2011449openalex-snapshot
Construction Methods for Asymmetric and Multiblock Space–Time Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928998openalex-snapshot
Maximal Orders in the Design of Dense Space-Time Lattice Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2023713openalex-snapshot
On the Densest MIMO Lattices From Cyclic Division Algebras
inferred← citeshttps://doi.org/10.1109/tit.2010.2054690openalex-snapshot
The Coding Gain of Real Matrix Lattices: Bounds and Existence Results
inferred← citeshttps://doi.org/10.1109/tit.2017.2683494openalex-snapshot
Almost universal codes achieving ergodic MIMO capacity within a constant gap
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.1142/s1793042114500602openalex-snapshot
Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve
inferred← citeshttps://doi.org/10.1142/s179304212050044xopenalex-snapshot
On the computation of overorders
inferred← citeshttps://doi.org/10.3934/amc.2023043openalex-snapshot
Fractional non-norm elements for division algebras, and an application to Cyclic Learning with Errors
inferred← citeshttps://doi.org/10.4171/owr/2005/32openalex-snapshot
Explicit Methods in Number Theory
inferred← citeshttps://doi.org/10.48550/arxiv.0906.0997openalex-snapshot
Division Algebras and Wireless Communication
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.