Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinding binomials in polynomial ideals
327
0
0.0
(
0
)
Added by
Thomas Kahle
Publication date
2016
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We describe an algorithm which finds binomials in a given ideal $Isubsetmathbb{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 degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo--Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory.
rate research
Read More
Let $R=mathbf{C}[xi_1,xi_2,ldots]$ be the infinite variable polynomial ring, equipped with the natural action of the infinite symmetric group $mathfrak{S}$. We classify the $mathfrak{S}$-primes of $R$, determine the containments among these ideals, and describe the equivariant spectrum of $R$. We emphasize that $mathfrak{S}$-prime ideals need not be radical, which is a primary source of difficulty. Our results yield a classification of $mathfrak{S}$-ideals of $R$ up to copotency. Our work is motivated by the interest and applications of $mathfrak{S}$-ideals seen in recent years.
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 binomials of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials.
Given the Hilbert function $u$ of a closed subscheme of a projective space over an infinite field $K$, let $m_u$ and $M_u$ be, respectively, the minimum and the maximum among all the Castelnuovo-Mumford regularities of schemes with Hilbert function $u$. I show that, for every integer $m$ such that $m_u leq m leq M_u$, there exists a scheme with Hilbert function $u$ and Castelnuovo-Mumford regularity $m$. As a consequence, the analogous algebraic result for an O-sequence $f$ and homogeneous polynomial ideals over $K$ with Hilbert function $f$ holds too. Although this result does not need any explicit computation, I also describe how to compute a scheme with the above requested properties. Precisely, I give a method to construct a strongly stable ideal defining such a scheme.
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 initial ideal gin(I) of I is radical (and essentially independent of the term order chosen). In this paper we describe generators and prime decomposition of gin(I) in terms of data related to the linear dependences among the row or columns of the submatrices of L. In the case of 2-minors we also give a closed formula for its multigraded Hilbert series.
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 than $t!/2$ terms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
