Algorithmic proofs of two theorems of Stafford. (Q2643577)

From MaRDI portal
Revision as of 13:15, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithmic proofs of two theorems of Stafford.
scientific article

    Statements

    title
    Algorithmic proofs of two theorems of Stafford. (English)
    0 references
    author
    Anton Leykin
    0 references
    publication date
    24 August 2007
    0 references
    zbMATH Keywords
    Weyl algebras
    0 references
    \(D\)-modules
    0 references
    Gröbner bases
    0 references
    minimal generation
    0 references

    Identifiers

    zbMATH DE Number
    5182731
    0 references
    OpenAlex ID
    W2005759996
    0 references
    arXiv ID
    math/0204303
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2643577&oldid=34986435"
    Powered by MediaWiki