Related papers: Free Resolutions and Sparse Determinantal Ideals
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
In this paper, we present several estimators of the diagonal elements of the inverse of the covariance matrix, called precision matrix, of a sample of iid random vectors. The focus is on high dimensional vectors having a sparse precision…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
We consider the following problem: Given a matrix A, find minimal subsets of columns of A with cardinality no larger than a given bound that are linear dependent or nearly so. This problem arises in various forms in optimization, electrical…
Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…
We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…
Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…
A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…
Random projection, a dimensionality reduction technique, has been found useful in recent years for reducing the size of optimization problems. In this paper, we explore the use of sparse sub-gaussian random projections to approximate…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…
The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…
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…
Estimation of a high dimensional precision matrix is a critical problem to many areas of statistics including Gaussian graphical models and inference on high dimensional data. Working under the structural assumption of sparsity, we propose…
Given $\Sigma\subset\mathbb K[x_1,\ldots,x_k]$, any finite collection of linear forms, some possibly proportional, and any $1\leq a\leq |\Sigma|$, it has been conjectured that $I_a(\Sigma)$, the ideal generated by all $a$-fold products of…
We compute the linear strand of the minimal free resolution of the ideal generated by k x k sub-permanents of an n x n generic matrix and of the ideal generated by square-free monomials of degree k. The latter calculation gives the full…
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse…
We propose methodology for estimation of sparse precision matrices and statistical inference for their low-dimensional parameters in a high-dimensional setting where the number of parameters $p$ can be much larger than the sample size. We…
This paper is concerned with finding bounds on betti numbers and describing combinatorially and topologically (minimal) free resolutions of powers of ideals generated by a fixed number $q$ of square-free monomials. Among such ideals, we…