Related papers: Ideals generated by corner-interval minors

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

In this article, we study the ideal generated by $2\times 2$ permanents of a symmetric matrix. We denote this ideal by $P_2(X)$ where $X$ is a symmetric matrix. We compute a Gr\"obner basis, dimension, depth, minimal primes, and a primary…

The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…

We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…

It is well-known that the Pl\"ucker relations generate the ideal of relations of the maximal minors of a generic matrix. In this paper we discuss the relations between minors of a (non-maximal) fixed size. We will exhibit minimal relations…

There is a longstanding conjecture by Fr\"oberg about the Hilbert series of the ring $R/I$, where $R$ is a polynomial ring, and $I$ an ideal generated by generic forms. We prove this conjecture true in the case when $I$ is generated by a…

We consider ideals arising in the context of conditional independence models that generalize the class of ideals considered by Fink [7] in a way distinct from the generalizations of Herzog-Hibi-Hreinsdottir-Kahle-Rauh [13] and Ay-Rauh [1].…

In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…

Let $X$ be the Hankel matrix of size $2\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\subset K[x_1,\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the…

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key…

Let I be the toric ideal of a homogeneous normal configuration. We prove that I is generated by circuits if and only if each unbalanced circuit of I has a "connector" which is a linear combination of circuits with a square-free term. In…

Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic…

Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable…

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…

We study the problem when an ideal generated by adjacent 2-minors is the toric ideal of a finite graph.

Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Groebner base of the ideal in the case of pure…

We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…