Related papers: Polyominoes and Knutson ideals
Brown and Gordon asked whether the Poisson Dixmier-Moeglin equivalence holds for any complex affine Poisson algebra; that is, whether the sets of Poisson rational ideals, Poisson primitive ideals, and Poisson locally closed ideals coincide.…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
This paper is concerned with tight closure in a commutative Noetherian ring $R$ of prime characteristic $p$, and is motivated by an argument of K. E. Smith and I. Swanson that shows that, if the sequence of Frobenius powers of a proper…
We study the properties of the rook complex $\mathcal{R}$ of a polyomino $\mathcal{P}$ seen as independence complex of a graph $G$, and the associated Stanley--Reisner ideal $I_\mathcal{R}$. In particular, we characterize the polyominoes…
Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…
Recently, the Mac\'ias topology has been generalized over integral domains that are not fields, to furnish a topological proof of the infinitude of prime elements under the assumption that the set of units is finite or not open. In this…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
Let $G$ be a group with identity $e$ and $R$ be a $G$-graded commutative ring with nonzero unity $1$. In this article, we introduce the concept of graded strongly $1$-absorbing primary ideals. A proper graded ideal $P$ of $R$ is said to be…
We compute the integer cohomology rings of the ``polygon spaces'' introduced in [Hausmann,Klyachko,Kapovich-Millson]. This is done by embedding them in certain toric varieties; the restriction map on cohomology is surjective and we…
In 1936, Krull asked if the integral closure of a primary ideal is still primary. Fifty years later, Huneke partially answered this question by giving a primary polynomial ideal whose integral closure is not primary in a regular local ring…
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which…
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…
We consider quantum Schubert cells in the quantum grassmannian and give a cell decomposition of the prime spectrum via the Schubert cells. As a consequence, we show that all primes are completely prime in the generic case where the…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
Using the recent results on square-free Gr\"obner degenerations by Conca and Varbaro, we proved that if a homogeneous ideal $I$ of a polynomial ring is such that its initial ideal $\mathrm{in}_<(I)$ is square-free and $\beta_0(I) =…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…
Given a monomial ideal in a polynomial ring over a field, we define the generalized Newton complementary dual of the given ideal. We show good properties of such duals including linear quotients and isomorphisms between the special fiber…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
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…