Related papers: Puzzle Ideals for Grassmannians
Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…
We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
Let $\mathcal{G}$ denote the variety generated by infinite dimensional Grassmann algebras; i.e., the collection of all unitary associative algebras satisfying the identity $[[z_1,z_2],z_3]=0$, where $[z_i,z_j]=z_iz_j-z_jz_i$. Consider the…
In this paper we explore the combinatorics of the non-negative part (G/P)+ of a cominuscule Grassmannian. For each such Grassmannian we define Le-diagrams -- certain fillings of generalized Young diagrams which are in bijection with the…
Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications, and yet most of the literature of the last two decades has focused thus…
In this work we study the problem of writing a Hermitian polynomial as a Hermitian sum of squares modulo a Hermitian ideal. We investigate a novel idea of Putinar-Scheiderer to obtain necessary matrix positivity conditions for Hermitian…
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…
We introduce the notion of Groebner S-basis of an ideal of the free associative algebra K<X> over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Groebner S-bases of the ideal…
In the article "Non-commutative Grobner bases for commutative algebras", Eisenbud-Peeva-Sturmfels proved a number of results regarding Grobner bases and initial ideals of those ideals in the free associative algebra which contain the…
Normal ideals on regular uncountable cardinals are familiar objects. We investigate ideals that are pleasant--while a normal ideal is closed under arbitrary diagonal unions, a pleasant ideal is closed only under diagonal unions indexed by…
Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle…
Neural codes form an algebraic framework to study the nervous system, and understanding neural codes is a key goal of mathematical neuroscience. Neural rings and ideals are the tools connecting neuroscience and commutative algebra. In this…
Free cumulants were introduced as the proper analog of classical cumulants in the theory of free probability. There is a mix of similarities and differences, when one considers the two families of cumulants. Whereas the combinatorics of…
Let $\mathbb{F}_q$ be a finite field, let $\mathbb{X}$ be a subset of a projective space ${\mathbb P}^{s-1}$, over the field $\mathbb{F}_q$, parameterized by rational functions, and let $I(\mathbb{X})$ be the vanishing ideal of…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
We describe all Mathieu-Zhao spaces of $k[x_1,\cdots,x_n]$ ($k$ is an algebraically closed field of characteristic zero) which contains an ideal of finite codimension. Furthermore we give an algorithm to decide if a subspace of the form…
Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…
We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…