Related papers: No short polynomials vanish on bounded rank matric…

We show that a determinantal ideal generated by $t$-minors does not contain any nonzero polynomials with $t!/2$ or fewer terms. Geometrically this means that any nonzero polynomial vanishing on all matrices of rank at most $t-1$ has more…

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

In the past decades, determinants and Pfaffians were found for eigenvalue correlations of various random matrix ensembles. These structures simplify the average over a large number of ratios of characteristic polynomials to integrations…

We determine a term order on the monomials in the variables $\varx{i}{j}$, $1 \leq i < j \leq n$, such that corresponding initial ideal of the ideal of Pfaffians of degree $r$ of a generic $n$ by $n$ skew-symmetric matrix is the…

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…

One important question in algebraic complexity is understanding the complexity of polynomial ideals (Grochow, Bulletin of EATCS 131, 2020). Andrews and Forbes (STOC 2022) studied the determinantal ideals $I^{\det}_{n,m,r}$ generated by the…

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Given a skew-symmetric matrix $X$, the Pfaffian of $X$ is defined as the square root of the determinant of $X$. In this article, we give the explicit defining equations of the Rees algebra of a Pfaffian ideal $I$ generated by the maximal…

Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…

We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…

We compute the diagonal F-thresholds of determinantal hypersurfaces arising from a generic matrix and from a generic symmetric matrix, as well as of the Pfaffian hypersurface arising from a generic skew-symmetric matrix of even size. The…

All matrices we consider have entries in a fixed algebraically closed field $K$. A minor of a square matrix is principal means it is defined by the same row and column indices. We study the ideal generated by size $t$ principal minors of a…

In this paper, we give a sufficient condition for a set $\mathal G$ of polynomials to be a Gr\"obner basis with respect to a given term-order for the ideal $I$ that it generates. Our criterion depends on the linkage pattern of the ideal $I$…

There are two significant families of minimal real matrix varieties: determinantal varieties and skew-symmetric determinantal varieties, the later ones are also known as Pfaffian varieties. In 1999, Kerckhove and Lawlor [Duke Math.J.…

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…