Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2010.10.014 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FGb / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2010.10.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010865943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of maximal minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihomogeneous resultant formulae by means of complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihomogeneous resultant formulae for systems with scaled support / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of MinRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multihomogeneous resultants using straight-line programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving general polynomial systems that respects m- homogeneous structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: New technique for decoding codes in the rank metric and its cryptography applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal minors and their leading terms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2010.10.014 / rank
 
Normal rank

Latest revision as of 05:33, 9 December 2024

scientific article
Language Label Description Also known as
English
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
scientific article

    Statements

    Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (English)
    0 references
    9 March 2011
    0 references
    The authors analyze the structure of ideals generated by generic bilinear equations. They describe very explicitly the syzygy module of these ideals. They propose a powerful extension of the well-known \(\mathbb{F}_5\) criterion in the case of bilinear systems. Furthermore, using the combinatorics of the syzygy module they derive an explicit, but complicated formula for the Hilbert bi-series. This helps them to understand the complexity analysis of a multihomogeneous variant of the \(F_5\) Algorithm. Finally, they analyze the complexity of computation of Gröbner bases of affine bilinear systems. They prove that the generic bilinear systems are regular, and they give an upper bound for the degree of regularity of these systems.
    0 references
    Gröbner basis
    0 references
    bihomogeneous ideal
    0 references
    algorithms
    0 references
    complexity
    0 references

    Identifiers