中文
相关论文

相关论文: On ideals generated by monomials and one binomial

200 篇论文

We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…

交换代数 · 数学 2019-08-15 Federico Galetto , Anthony V. Geramita , David L. Wehlau

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

交换代数 · 数学 2016-06-01 Ezra Miller

Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…

交换代数 · 数学 2022-12-27 Reza Abdolmaleki , Rashid Zaare-Nahandi

This paper describes a method for computing all F-pure ideals for a given Cartier map of a polynomial ring over a finite field.

交换代数 · 数学 2018-05-18 Alberto F. Boix , Mordechai Katzman

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

交换代数 · 数学 2020-07-15 William Simmons , Henry Towsner

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

交换代数 · 数学 2007-05-23 Edward Mosteig

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…

交换代数 · 数学 2011-08-10 Gerhard Pfister , Afshan Sadiq , Stefan Steidel

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…

交换代数 · 数学 2015-10-09 Hara Charalambous , Apostolos Thoma , Marius Vladoiu

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

交换代数 · 数学 2023-08-08 Dancheng Lu , Hao Zhou

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…

交换代数 · 数学 2019-01-23 Amir Mafi , Dler Naderi

Motivated by Carmichael numbers, we say that a finite ring $R$ is a Carmichael ring if $a^{|R|}=a$ for any $a \in R$. We then call an ideal $I$ of a ring $R$ as a Carmichael ideal if $R/I$ is a Carmichael ring, and a Carmichael element of…

数论 · 数学 2019-05-10 Sunghan Bae , Su Hu , Min Sha

A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…

交换代数 · 数学 2026-05-13 Roberto Díaz , Giancarlo Lucchini Arteche

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

交换代数 · 数学 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

Vanishing polynomials are polynomials over a ring which output $0$ for all elements in the ring. In this paper, we study the ideal of vanishing polynomials over specific types of rings, along with the closely related ring of polynomial…

交换代数 · 数学 2023-10-04 Matvey Borodin , Ethan Liu , Justin Zhang

Let $A$ be the quotient of a graded polynomial ring $\mathbb{Z}[x_1,\cdots,x_m]\otimes\Lambda[y_1,\cdots,y_n]$ by an ideal generated by monomials with leading coefficients 1. Then we constructed a space~$X_A$ such that $A$ is isomorphic to…

代数拓扑 · 数学 2023-05-17 Tseleung So , Donald Stanley

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

组合数学 · 数学 2015-09-11 Carsten Conradi , Thomas Kahle

Let R be a nil ring. We prove that primitive ideals in the polynomial ring R[x] in one indeterminate over R are of the form I[x] for some ideals I of R.

环与代数 · 数学 2007-05-23 Agata Smoktunowicz

Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S…

交换代数 · 数学 2017-10-17 Guillermo Alesandroni

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

逻辑 · 数学 2015-06-26 Eudes Naziazeno

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

交换代数 · 数学 2007-05-23 Sara Faridi