Koszul-type determinantal formulas for families of mixed multilinear systems
From MaRDI portal
Publication:5157586
DOI10.1137/20M1332190zbMATH Open1477.13053arXiv2105.13188OpenAlexW3168856416MaRDI QIDQ5157586FDOQ5157586
Authors: Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas 
Publication date: 19 October 2021
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Abstract: Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula when we can express it as a determinant of a matrix whose elements are the coefficients of the input polynomials. We study the resultant in the context of mixed multilinear polynomial systems, that is multilinear systems with polynomials having different supports, on which determinantal formulas were not known. We construct determinantal formulas for two kind of multilinear systems related to the Multiparameter Eigenvalue Problem (MEP): first, when the polynomials agree in all but one block of variables; second, when the polynomials are bilinear with different supports, related to a bipartite graph. We use the Weyman complex to construct Koszul-type determinantal formulas that generalize Sylvester-type formulas. We can use the matrices associated to these formulas to solve square systems without computing the resultant. The combination of the resultant matrices with the eigenvalue and eigenvector criterion for polynomial systems leads to a new approach for solving MEP.
Full work available at URL: https://arxiv.org/abs/2105.13188
Recommendations
determinantal formulamultiparameter eigenvalue problemmultilinear polynomialsresultant matrixKoszul-type matrixWeyman complex
Eigenvalues, singular values, and eigenvectors (15A18) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Solving polynomial systems; resultants (13P15)
Cites Work
- On the quadratic two-parameter eigenvalue problem and its linearization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiparameter eigenvalue problems and expansion theorems
- Heights of varieties in multiprojective spaces and arithmetic nullstellensätze
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- Title not available (Why is that?)
- Discriminants, resultants, and multidimensional determinants
- Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
- Inertia forms and resultant: A formulary
- Title not available (Why is that?)
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- Solving equations via algebras
- A Poisson formula for the sparse resultant
- The resultant as the determinant of a Koszul complex
- Spectral collocation solutions to multiparameter Mathieu's system
- Vector bundles on complex projective spaces. With an appendix by S. I. Gelfand
- The Expected Number of Nash Equilibria of a Normal Form Game
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Cryptanalysis of MinRank
- Title not available (Why is that?)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Expressing a fraction of two determinants as a determinant
- Explicit formulas for the multivariate resultant.
- On the complexity of sparse elimination
- Macaulay style formulas for sparse resultants
- Title not available (Why is that?)
- On the bit complexity of solving bilinear polynomial systems
- Introduction to algebraic independence theory. With contributions from F. Amoroso, D. Bertrand, W. D. Brownawell, G. Diaz, M. Laurent, Yu. V. Nesterenko, K. Nishioka, P. Philippon, G. Rémond, D. Roy, M. Waldschmidt
- Matrices in elimination theory
- Multihomogeneous resultant formulae by means of complexes
- Multigraded resultants of Sylvester type
- Title not available (Why is that?)
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Conditions for exact resultants using the Dixon formulation
- Title not available (Why is that?)
- Calculating Discriminants by Higher Direct Images
- A homotopy method for finding all solutions of a multiparameter eigenvalue problem
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Multilinear polynomial systems: root isolation and bit complexity
- Bilinear Systems with Two Supports
- Fiber product homotopy method for multiparameter eigenvalue problems
- Towards Mixed Gröbner Basis Algorithms
- Numerical root finding via Cox rings
- Gröbner basis over semigroup algebras. Algorithms and applications for sparse polynomial systems
- Resultants and discriminants for bivariate tensor-product polynomials
Cited In (4)
Uses Software
This page was built for publication: Koszul-type determinantal formulas for families of mixed multilinear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157586)
