A Zassenhaus-type algorithm solves the Bogoliubov recursion (Q3065230)

From MaRDI portal
Revision as of 11:12, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Zassenhaus-type algorithm solves the Bogoliubov recursion
scientific article

    Statements

    author
    Kurusch Ebrahimi-Fard
    0 references
    Frédéric Patras
    0 references
    publication date
    4 January 2011
    0 references
    arXiv classification
    math-ph
    0 references
    hep-th
    0 references
    math.CO
    0 references
    math.MP
    0 references

    Identifiers

    Mathematics Subject Classification ID
    81T15
    0 references
    05E05
    0 references
    16T05
    0 references
    17D25
    0 references
    81T18
    0 references
    81T17
    0 references
    22E70
    0 references
    zbMATH DE Number
    5832287
    0 references
    arXiv ID
    0710.5134
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3065230&oldid=33589882"
    Powered by MediaWiki