English
Related papers

Related papers: Ideals generated by diagonal 2-minors

200 papers

Let $p$ be a prime number, $\Bbbk$ a field of characteristic $p$ and $G$ a finite $p$-group. Let $V$ be a finite-dimensional linear representation of $G$ over $\Bbbk$. Write $S = \mathrm{Sym} V^*$. For a class of $p$-groups which we call…

Commutative Algebra · Mathematics 2021-05-25 Manoj Kummini , Mandira Mondal

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

Commutative Algebra · Mathematics 2021-01-21 Charlie Miller , Branden Stone

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

Commutative Algebra · Mathematics 2017-05-09 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

Let $L\subset \mathbb{Z}^n$ be a lattice and $I_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle$ be the corresponding lattice ideal in $\Bbbk[x_1,\ldots, x_n]$, where $\Bbbk$ is a field. In this paper we describe minimal…

Commutative Algebra · Mathematics 2017-01-23 Hara Charalambous , Apostolos Thoma , Marius Vladoiu

Let $G$ be a simple connected non-complete graph and $J_G$ be its binomial edge ideal in a polynomial ring $S$. Using certain invariants associated to graphs, say $U(G)$, Banerjee and N\'{u}\~{n}ez-Betancourt gave an upper bound for the…

Commutative Algebra · Mathematics 2024-03-29 A. V. Jayanthan , Rajib Sarkar

Describing families of ideals that are minimally generated by at least one, or by all, of their reduced Gr\"obner bases is a central topic in commutative algebra. In this paper, we address this problem in the context of toric ideals of…

Commutative Algebra · Mathematics 2025-04-09 Ignacio García-Marco , Irene Márquez-Corbella , Christos Tatakis

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

Commutative Algebra · Mathematics 2025-02-05 Takayuki Hibi , Seyed Amin Seyed Fakhari

Let $R$ be a commutative ring with identity and let $I$ be an ideal of $R$. Let $R\Join I$ be the subring of $R\times R$ consisting of the elements $(r,r+i)$ for $r\in R$ and $i\in I$. We study the diameter and girth of the zero-divisor…

Combinatorics · Mathematics 2007-05-23 Hamid Reza Maimani , Siamak Yassemi

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

Combinatorics · Mathematics 2007-05-23 Einar Steingrimsson

Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$ and $I\subset S$ be a squarefree monomial ideal generated in degree $n-2$. Motivated by the remarkable behavior of the powers of $I$ when $I$ admits a linear resolution, as…

Commutative Algebra · Mathematics 2025-08-28 Antonino Ficarra , Somayeh Moradi

A signed graph is a pair $(G,\tau)$ of a graph $G$ and its sign $\tau$, where a \textit{sign} $\tau$ is a function from $\{ (e,v)\mid e\in E(G),v\in V(G), v\in e\}$ to $\{1,-1\}$. Note that graphs or digraphs are special cases of signed…

Combinatorics · Mathematics 2020-04-03 JiSun Huh , Sangwook Kim , Boram Park

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Commutative Algebra · Mathematics 2017-06-29 Sara Saeedi Madani , Dariush Kiani

We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…

Combinatorics · Mathematics 2007-05-23 M. Borges-Quintana , M. A. Borges-Trenard , P. Fitzpatrick , E. Martinez-Moro

We investigate the minimal number of generators $\mu$ and the depth of divisorial ideals over normal semigroup rings. Such ideals are defined by the inhomogeneous systems of linear inequalities associated with the support hyperplanes of the…

Commutative Algebra · Mathematics 2007-05-23 W. Bruns , J. Gubeladze

Let R be a commutative ring with identity and I be an ideal of R. The cozero-divisor graph with respect to I, denoted by $\Gamma''_I(R)$, is the graph of R with vertices {x \in R -I :xR +I \not=R} and two distinct vertices $x$ and $y$ are…

Commutative Algebra · Mathematics 2025-10-24 F. Farshadifar

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Combinatorics · Mathematics 2022-10-26 Ziyu Huang , Thomas Michael Keller , Shane Kissinger , Wen Plotnick , Maya Roma

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…

Commutative Algebra · Mathematics 2013-09-23 Sara Malec

Let $(A,\mathfrak{m})$ be an excellent normal domain of dimension two. We define an $\mathfrak{m}$-primary ideal $I$ to be a $p_g$-ideal if the Rees algebra $A[It]$ is a Cohen-Macaulay normal domain. When $A$ contains an algebraically…

Commutative Algebra · Mathematics 2018-08-29 Tony J. Puthenpurakal

The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…

Combinatorics · Mathematics 2017-10-11 J. I. Brown , D. Cox
‹ Prev 1 3 4 5 6 7 10 Next ›