Related papers: Choosing between incompatible ideals

For given positive integers $m$ and $n$ with $m<n$, the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$th moments for $1\leq k\leq m$; in the ideal case one requires…

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…

We study ad-nilpotent ideals of a parabolic subalgebra of a simple Lie algebra. Any such ideal determines an antichain in a set of positive roots of the simple Lie algebra. We give a necessary and sufficient condition for an antichain to…

In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials $f_0,f_1,\dots, f_k$ and the question is to decide whether $f_0$ belongs to the ideal generated by $f_1,\dots,f_k$. In the more…

In this paper, we prove that if $I\subset S:=K[x_1,...,x_n]$ is a monomial ideal then $I$ and $S/I$ satisfy the Stanley conjecture when $I$ has a small number of generators, with respect to $\depth(S/I)$ and $\max\{|P|:\;P\in\Ass(S/I)\}$.…

Let $R$ be a commutative ring with nonzero identity, and $\delta :\mathcal{I(R)}\rightarrow\mathcal{I(R)}$ be an ideal expansion where $\mathcal{I(R)}$ the set of all ideals of $R$. In this paper, we introduce the concept of…

Let $R$ be a Noetherian local ring and let $I$ be an ideal in $R$. The ideal $I$ is called balanced if the colon ideal $J:I$ is independent of the choice of the minimal reduction $J$ of $I$. Under suitable assumptions, Ulrich showed that…

In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Let R be an integral domain and I a nonzero ideal of R. A sub-ideal J of I is a t-reduction of I if (JI^{n})_{t}=(I^{n+1})_{t} for some positive integer n. An element x in R is t-integral over I if there is an equation x^{n} + a_{1}x^{n-1}…

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

The task of learning to pick a single preferred example out a finite set of examples, an "optimal choice problem", is a supervised machine learning problem with complex, structured input. Problems of optimal choice emerge often in various…

We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…

Let $ E $ be a possibly infinite set and let $ M $ and $ N $ be matroids defined on $ E $. We say that the pair $ \{ M,N \} $ has the Intersection property if $ M $ and $ N $ share an independent set $ I $ admitting a bipartition $…

The problem of model selection is considered for the setting of interpolating estimators, where the number of model parameters exceeds the size of the dataset. Classical information criteria typically consider the large-data limit,…

During the first step of practical reasoning, i.e. deliberation, an intelligent agent generates a set of pursuable goals and then selects which of them he commits to achieve. An intelligent agent may in general generate multiple pursuable…

We study the finite generation of the intersection algebra of two principal ideals I and J in a unique factorization domain R. We provide an algorithm that produces a list of generators of this algebra over R. In the special case that R is…

Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$ and $I$ is an ideal in $A$. Then M. P. Murthy conjectured that $\mu(I)=\mu(I/I^2)$, where $\mu$ denotes the minimal number of generators. Recently, Fasel \cite{F}…

Comparisons are made for the amount of agreement of the composite likelihood information criteria and their full likelihood counterparts when making decisions among the fits of different models, and some properties of penalty term for…