Related papers: Multihomogeneous resultant formulae by means of co…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
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…
This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid…
We present formulas for the homogenous multivariate resultant as a quotient of two determinants. They extend classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
It is known that all the vector bundles of the title can be obtained by holomorphic induction from representations of a certain parabolic Lie algebra on finite dimensional inner product spaces. The representations, and the induced bundles,…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…
We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant,…
Using results of Fayers on the structure of Specht modules, we prove two different formulae for the determinant of matrices which are obtained by amalgamating the entries of two smaller matrices. In particular, this gives formulae for…
Given a sheaf on a projective space P^n we define a sequence of canonical and easily computable Chow complexes on the Grassmannians of planes in P^n, generalizing the Beilinson monad on P^n. If the sheaf has dimension k, then the Chow form…
We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly…
We study finite probability theory through a category of finite probability schemes and probability-preserving maps, called \emph{bundles}. A bundle simultaneously records a quotient of a sample space, an algebra of random variables, and…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…