Related papers: Binomial Difference Ideals
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
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…
In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…
A subideal is an ideal of an ideal of B(H) and a principal subideal is a principal ideal of an ideal of B(H). We determine necessary and sufficient conditions for a principal subideal to be an ideal of B(H). This generalizes to arbitrary…
For any polynomial ideal $I$, let the minimal triangular set contained in the reduced Buchberger-Gr\"obner basis of $I$ with respect to the purely lexicographical term order be called the W-characteristic set of $I$. In this paper, we…
We consider ideals in the ring $\mathbb{Z}_2[x_1,\ldots, x_n]$ that contain the polynomials $x_i^2 - x_i$ for $i = 1, \ldots, n$ and give various results related to the one-to-one correspondence between these ideals and the subsets of…
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…
Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our…
Let $ f_i: X \rightarrow {\bf C}$, for $i$ integer between $ 1$ and $ p $, be analytic functions defined on a complex analytic variety $X$. Let us consider $ {\cal D}_X $ the ring of linear differential operators and $ {\cal D}_X [s_1,…
This paper studies the combinatorics of ideals which recently appeared in ergodicity results for analytic equivalence relations. The ideals have the following topological representation. There is a separable metrizable space $X$, a…
Neural ideals, originally defined in arXiv:1212.4201, give a way of translating information about the firing pattern of a set of neurons into a pseudomonomial ideal in a polynomial ring. We give a simple criterion for determining whether a…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…
We analyse preference inference, through consistency, for general preference languages based on lexicographic models. We identify a property, which we call strong compositionality, that applies for many natural kinds of preference…
Let $X$ be an integral scheme of finite type over a complete DVR of mixed characteristic. We provide a definition of a test ideal which agrees with the multiplier ideal after inverting $p$, is computed from a sufficiently large alteration,…