Related papers: Symmetric and skew-symmetric block-Kronecker linea…
We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…
We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
The complete classification of (3,3)-nets and of (3,4)-nets with only double and triple points is given. Up to lattice isomorphism, there are exactly 3 effective possibilities in each case, and some of these provide new examples of…
We devise a spectral divide-and-conquer scheme for matrices that are self-adjoint with respect to a given indefinite scalar product (i.e. pseudosymmetic matrices). The pseudosymmetric structure of the matrix is preserved in the spectral…
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…
The main purpose of this paper is twofold. We first want to analyze in details the meaningful geometric aspect of the method introduced in the previous paper [12], concerning regularity of families of irreducible, nodal "curves" on a…
Let $C$ be an algebraic curve defined by a sufficiently generic bivariate Laurent polynomial with given Newton polygon $\Delta$. It is classical that the geometric genus of $C$ equals the number of lattice points in the interior of…
Bundles of matrix polynomials are sets of matrix polynomials with the same size and grade and the same eigenstructure up to the specific values of the eigenvalues. It is known that the closure of the bundle of a pencil $L$ (namely, a matrix…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron…
We study the invariants (in particular, the central invariants) of suitable Poisson pencils from the point of view of the theory of bi-Hamiltonian reduction, paying a particular attention to the case where the Poisson pencil is exact. We…
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…
In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic matrix…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…