Related papers: Generic skew-symmetric matrix polynomials with fix…

We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…

We construct stable vector bundles on the space of symmetric forms of degree d in n+1 variables which are equivariant for the action of SL_{n+1}(C), and admit an equivariant free resolution of length 2. For n=1, we obtain new examples of…

Let $S_\alpha = k\langle x_1,\dots,x_n\rangle /(x_i x_j - \alpha_{ij} x_j x_i)$ be a standard graded skew polynomial algebra over an algebraically closed field $k$ of characteristic not equal to $2$. We show the following results. When $n$…

We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…

Recent work shows that a new family of norms on Hermitian matrices arise by evaluating the even degree complete homogeneous symmetric (CHS) polynomials on the eigenvalues of a Hermitian matrix. The CHS norm of a graph is then defined by…

We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems…

This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…

A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

Exactly integrable systems connected to semisimple algebras of second rank with an arbitrary choice of grading are presented in explicit form. General solutions of these systems are expressed in terms of matrix elements of two fundamental…

We determine the Bernstein-Sato polynomials for the ideal of maximal minors of a generic m x n matrix, as well as for that of sub-maximal Pfaffians of a generic skew-symmetric matrix of odd size. As a corollary, we obtain that the Strong…

This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…

An $n$ by $n$ skew-symmetric type $(-1,1)$-matrix $K=[k_{i,j}]$ has $1$'s on the main diagonal and $\pm 1$'s elsewhere with $k_{i,j}=-k_{j,i}$. The largest possible determinant of such a matrix $K$ is an interesting problem. The literature…

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…

In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…

The maximum of the absolute value of a real homogeneous polynomial of degree $d\ge 3$ on the unit sphere corresponds to the spectral norm of the induced real $d$-symmetric tensor $\mathcal{S}$. We give two sequences of upper bounds on the…

In this article, we classify all symmetric generalized numerical semigroups in $\mathbb{N}^d$ of embedding dimension $2d+1$. Consequently, we show that in this case the property of being symmetric is equivalent to have a unique maximal gap…