Related papers: Multihomogeneous resultant formulae by means of co…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
We collect three observations on the homology for Smale spaces defined by Putnam. The definition of such homology groups involves four complexes. It is shown here that a simple convergence theorem for spectral sequences can be used to prove…
We consider the problem of constructing matrices of linear forms of constant rank by focusing on the associated vector bundles on projective spaces. Important examples are given by the classical Steiner bundles, as well as some special…
We present closed form expressions for the ranks of all cohomology groups of holomorphic line bundles on several Calabi-Yau threefolds realised as complete intersections in products of projective spaces. The formulae have been obtained by…
Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
Multigraded linear series generalize the classical morphism to the linear series of a basepoint-free line bundle on a scheme. We investigate the collection of the natural cornering morphisms into elementary bigraded linear series obtained…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system.…
In the Hamiltonian formalism, and in the presence of a symmetry Lie group, a variational reduction procedure has already been developed for Hamiltonian systems without constraints. In this paper we present a procedure of the same kind, but…
We develop a reduction scheme \`a la Marsden-Weinstein-Meyer for hybrid Hamiltonian systems. Our method does not require the momentum map to be equivariant, neither to be preserved by the impact map. We illustrate the applicability of our…
We prove that every projective embedding of a connected scheme determined by the complete linear series of a sufficiently ample line bundle is defined by the 2-minors of a 1-generic matrix of linear forms. Extending the work of…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
In ensemble methods, the outputs of a collection of diverse classifiers are combined in the expectation that the global prediction be more accurate than the individual ones. Heterogeneous ensembles consist of predictors of different types,…
We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…
We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…