English
Related papers

Related papers: Generic matrix polynomials with fixed rank and fix…

200 papers

Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…

Algebraic Geometry · Mathematics 2021-11-01 Antonio Lerario , Michele Stecconi

Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…

Rings and Algebras · Mathematics 2026-01-13 Vesselin Drensky , Boyan Kostadinov

The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…

Numerical Analysis · Mathematics 2018-03-19 Froilán M. Dopico , Javier Pérez , Paul Van Dooren

We determine the rank of a general real binary form of degree d=4 and d=5. In the case d=5, the possible values of the rank of such general forms are 3,4,5. The existence of three typical ranks was unexpected. We prove that a real binary…

Algebraic Geometry · Mathematics 2009-09-29 Pierre Comon , Giorgio Ottaviani

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

Commutative Algebra · Mathematics 2026-02-10 Zihao Dai , Hao Liang , Jingyu Lu , Lihong Zhi

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

The zero sets of harmonic polynomials play a crucial role in the study of the free boundary regularity problem for harmonic measure. In order to understand the fine structure of these free boundaries a detailed study of the singular points…

Classical Analysis and ODEs · Mathematics 2018-03-16 Matthew Badger , Max Engelstein , Tatiana Toro

We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M.…

Algebraic Geometry · Mathematics 2017-02-08 Edoardo Ballico

In this paper we prove that the PDE $p(D)f=q,$ where $p$ and $q$ are multivariate polynomials, has a solution in the space of polynomials of total degree not exceeding ${n+s},$ where $n$ is the degree of $q$ and $s$ is the zero order of…

Analysis of PDEs · Mathematics 2021-06-02 Anna R. Gharibyan , Hakop A. Hakopian

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

Principal matrices of a numerical semigroup of embedding dimension n are special types of $n \times n$ matrices over integers of rank $\leq n - 1$. We show that such matrices and even the pseudo principal matrices of size n must have rank…

Commutative Algebra · Mathematics 2021-06-21 Papri Dey , Hema Srinivasan

In previous work, we proved that the continuous roots of a monic polynomial of degree $d$ whose coefficients depend in a $C^{d-1,1}$ way on real parameters belong to the Sobolev space $W^{1,q}$ for all $1\le q<d/(d-1)$. This is optimal. We…

Functional Analysis · Mathematics 2024-10-03 Adam Parusiński , Armin Rainer

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Algebraic Geometry · Mathematics 2008-07-22 Tim Netzer

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Commutative Algebra · Mathematics 2016-08-22 Boris Bukh

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

Rings and Algebras · Mathematics 2011-12-07 Adam Chapman

In this paper we prove some characterizations of the matrix orthogonal polynomials whose derivatives are also orthogonal, which generalize other known ones in the scalar case. In particular, we prove that the corresponding orthogonality…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. J. Cantero , L. Moral , L. Velazquez

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

Algebraic Geometry · Mathematics 2018-04-10 Edoardo Ballico , Alessandro De Paris

We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…

Optimization and Control · Mathematics 2016-11-01 Ian Davidson , Henry Wolkowicz

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

Symbolic Computation · Computer Science 2014-02-11 Bernd Bank , Marc Giusti , Joos Heintz , Mohab Safey El Din