Related papers: Quadrics defined by skew-symmetric matrices

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…

Let $R = k[x]/I$ where $I$ is the defining ideal of a rational normal $k$-scroll. We compute the Betti numbers of the ground field $\mathbb{k}$ as a module over $R$. For $k = 2$, we give the minimal free resolution of $\mathbb{k}$ over $R$.

Let $K$ be a field and $X$, $Y$ denote matrices such that, the entries of $X$ are either indeterminates over $K$ or $0$ and the entries of $Y$ are indeterminates over $K$ which are different from those appearing in $X$. We consider ideals…

The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…

Let $\u_{1\times n}$, $\X_{n\times n}$, and $\v_{n\times 1}$ be matrices of indeterminates, $\Adj \X$ be the classical adjoint of $\X$, and $H(n)$ be the ideal $I_1(\u\X)+I_1(\X\v)+I_1(\v\u-\Adj \X)$. Vasconcelos has conjectured that $H(n)$…

For an ideal $I_{m,n}$ generated by all square-free monomials of degree $m$ in a polynomial ring $R$ with $n$ variables, we obtain a specific embedding of a canonical module of $R/I_{m,n}$ to $R/I_{m,n}$ itself. The construction of this…

Semidefinite programming is based on optimization of linear functionals over convex sets defined by linear matrix inequalities, namely, inequalities of the form $$L_A(X)=I-A_1X_1-\dots-A_g X_g\succeq0.$$ Here the $X_j$ are real numbers and…

We survey some recent results on the minimal graded free resolution of a square-free monomial ideal. The theme uniting these results is the point-of-view that the generators of a monomial ideal correspond to the maximal faces (the facets)…

In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…

Let $V$ be a nonempty finite set and $A=(a_{ij})_{i,j\in V}$ be a matrix with entries in a field $\mathbb{K}$. For a subset $X$ of $V$, we denote by $A[X]$ the submatrix of $A$ having row and column indices in $X$. We study the following…

Let $\mathbb{K}$ be a field and $A$ a Noetherian $\mathbb{K}$-algebra. In a paper of 2020, M. Albert, C. Bertone, M. Roggero and W. M. Seiler proved that, given a quasi-stable module $U \subset R^m$ with $R=\mathbb{K}[x_0,\dots,x_n]$, any…

The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex basic non-commutative semi-algebraic set. The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and…

In arXiv:math/0405373 , Eisenbud, Huneke and Ulrich conjectured a result on the Castelnuovo-Mumford regularity of the embedding of a projective space $\mathbb{P}^{n-1}\hookrightarrow \mathbb{P}^{r-1}$ determined by generators of a linearly…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

Given a sequence of related modules $M_n$ over a sequence of related Noetherian polynomial rings, where each $M_n$ is a representation of the symmetric group on $n$ letters, one may ask how to simultaneously compute an equivariant free…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

Let $\mathbb K$ be a field of characteristic 0. Given $n$ linear forms in $R=\mathbb K[x_1,\ldots,x_k]$, with no two proportional, in one of our main results we show that the ideal $I\subset R$ generated by all $(n-2)$-fold products of…

We study a class of spectral design problems in which a prior positive semidefinite information matrix is updated by a sum of rank-one matrices constructed from chosen design vectors subject to a bound on their Euclidean norm. The objective…

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of…