Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559)

From MaRDI portal
Revision as of 13:21, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7702993
Language Label Description Also known as
English
Computing Circuit Polynomials in the Algebraic Rigidity Matroid
scientific article; zbMATH DE number 7702993

    Statements

    title
    Computing Circuit Polynomials in the Algebraic Rigidity Matroid (English)
    0 references
    author
    Goran Malić
    0 references
    Ileana Streinu
    0 references
    publication date
    27 June 2023
    0 references
    zbMATH Keywords
    Cayley-Menger ideal
    0 references
    rigidity matroid
    0 references
    circuit polynomial
    0 references
    combinatorial resultant
    0 references
    inductive construction
    0 references
    Gröbner basis elimination
    0 references
    cites work
    Q2872959
    0 references
    Q5610277
    0 references
    Q5461825
    0 references
    Distance Geometry
    0 references
    Q4279195
    0 references
    Q4846449
    0 references
    Q5626684
    0 references
    Q3360999
    0 references
    Q2770573
    0 references
    Q4356576
    0 references
    Q5390304
    0 references
    Q5524326
    0 references
    Q5587075
    0 references
    Q5511421
    0 references
    Q4717849
    0 references

    Identifiers

    arXiv ID
    2304.12435
    0 references
    DOI
    10.1137/21m1437986
    0 references
    Mathematics Subject Classification ID
    68W30
    0 references
    05B35
    0 references
    13P10
    0 references
    13P15
    0 references
    14Q20
    0 references
    52C25
    0 references
    68Q06
    0 references
    zbMATH DE Number
    7702993
    0 references
    OpenAlex ID
    W4377966690
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6161559&oldid=37530062"
    Powered by MediaWiki