Displaying similar documents to “The linear syzygy graph of a monomial ideal and linear resolutions”

The cleanness of (symbolic) powers of Stanley-Reisner ideals

Somayeh Bandari, Ali Soleyman Jahan (2017)

Czechoslovak Mathematical Journal

Similarity:

Let Δ be a pure simplicial complex on the vertex set [ n ] = { 1 , ... , n } and I Δ its Stanley-Reisner ideal in the polynomial ring S = K [ x 1 , ... , x n ] . We show that Δ is a matroid (complete intersection) if and only if S / I Δ ( m ) ( S / I Δ m ) is clean for all m and this is equivalent to saying that S / I Δ ( m ) ( S / I Δ m , respectively) is Cohen-Macaulay for all m . By this result, we show that there exists a monomial ideal I with (pretty) cleanness property while S / I m or S / I ( m ) is not (pretty) clean for all integer m 3 . If dim ( Δ ) = 1 , we also prove that S / I Δ ( 2 ) ( S / I Δ 2 ) is clean if and only...

A note on the multiplier ideals of monomial ideals

Cheng Gong, Zhongming Tang (2015)

Czechoslovak Mathematical Journal

Similarity:

Let 𝔞 [ x 1 , ... , x n ] be a monomial ideal and 𝒥 ( 𝔞 c ) the multiplier ideal of 𝔞 with coefficient c . Then 𝒥 ( 𝔞 c ) is also a monomial ideal of [ x 1 , ... , x n ] , and the equality 𝒥 ( 𝔞 c ) = 𝔞 implies that 0 < c < n + 1 . We mainly discuss the problem when 𝒥 ( 𝔞 ) = 𝔞 or 𝒥 ( 𝔞 n + 1 - ε ) = 𝔞 for all 0 < ε < 1 . It is proved that if 𝒥 ( 𝔞 ) = 𝔞 then 𝔞 is principal, and if 𝒥 ( 𝔞 n + 1 - ε ) = 𝔞 holds for all 0 < ε < 1 then 𝔞 = ( x 1 , ... , x n ) . One global result is also obtained. Let 𝔞 ˜ be the ideal sheaf on n - 1 associated with 𝔞 . Then it is proved that the equality 𝒥 ( 𝔞 ˜ ) = 𝔞 ˜ implies that 𝔞 ˜ is principal.

The operation and * operation of Cohen-Macaulay bipartite graphs

Yulong Yang, Guangjun Zhu, Yijun Cui, Shiya Duan (2024)

Czechoslovak Mathematical Journal

Similarity:

Let G be a finite simple graph with the vertex set V and let I G be its edge ideal in the polynomial ring S = 𝕂 [ V ] . We compute the depth and the Castelnuovo-Mumford regularity of S / I G when G = G 1 G 2 or G = G 1 * G 2 is a graph obtained from Cohen-Macaulay bipartite graphs G 1 , G 2 by the operation or * operation, respectively.

Hardness of embedding simplicial complexes in d

Jiří Matoušek, Martin Tancer, Uli Wagner (2011)

Journal of the European Mathematical Society

Similarity:

Let 𝙴𝙼𝙱𝙴𝙳 k d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k , does there exist a (piecewise linear) embedding of K into d ? Known results easily imply polynomiality of 𝙴𝙼𝙱𝙴𝙳 k 2 ( k = 1 , 2 ; the case k = 1 , d = 2 is graph planarity) and of 𝙴𝙼𝙱𝙴𝙳 k 2 k for all k 3 . We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that 𝙴𝙼𝙱𝙴𝙳 d d and 𝙴𝙼𝙱𝙴𝙳 ( d - 1 ) d are undecidable for each d 5 . Our main result is NP-hardness of 𝙴𝙼𝙱𝙴𝙳 2 4 and, more generally, of 𝙴𝙼𝙱𝙴𝙳 k d for all...

Depth and Stanley depth of the facet ideals of some classes of simplicial complexes

Xiaoqi Wei, Yan Gu (2017)

Czechoslovak Mathematical Journal

Similarity:

Let Δ n , d (resp. Δ n , d ' ) be the simplicial complex and the facet ideal I n , d = ( x 1 x d , x d - k + 1 x 2 d - k , ... , x n - d + 1 x n ) (resp. J n , d = ( x 1 x d , x d - k + 1 x 2 d - k , ... , x n - 2 d + 2 k + 1 x n - d + 2 k , x n - d + k + 1 x n x 1 x k ) ). When d 2 k + 1 , we give the exact formulas to compute the depth and Stanley depth of quotient rings S / J n , d and S / I n , d t for all t 1 . When d = 2 k , we compute the depth and Stanley depth of quotient rings S / J n , d and S / I n , d , and give lower bounds for the depth and Stanley depth of quotient rings S / I n , d t for all t 1 .

On the symmetric algebra of certain first syzygy modules

Gaetana Restuccia, Zhongming Tang, Rosanna Utano (2022)

Czechoslovak Mathematical Journal

Similarity:

Let ( R , 𝔪 ) be a standard graded K -algebra over a field K . Then R can be written as S / I , where I ( x 1 , ... , x n ) 2 is a graded ideal of a polynomial ring S = K [ x 1 , ... , x n ] . Assume that n 3 and I is a strongly stable monomial ideal. We study the symmetric algebra Sym R ( Syz 1 ( 𝔪 ) ) of the first syzygy module Syz 1 ( 𝔪 ) of 𝔪 . When the minimal generators of I are all of degree 2, the dimension of Sym R ( Syz 1 ( 𝔪 ) ) is calculated and a lower bound for its depth is obtained. Under suitable conditions, this lower bound is reached.

The small Ree group 2 G 2 ( 3 2 n + 1 ) and related graph

Alireza K. Asboei, Seyed S. S. Amiri (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let G be a finite group. The main supergraph 𝒮 ( G ) is a graph with vertex set G in which two vertices x and y are adjacent if and only if o ( x ) o ( y ) or o ( y ) o ( x ) . In this paper, we will show that G 2 G 2 ( 3 2 n + 1 ) if and only if 𝒮 ( G ) 𝒮 ( 2 G 2 ( 3 2 n + 1 ) ) . As a main consequence of our result we conclude that Thompson’s problem is true for the small Ree group 2 G 2 ( 3 2 n + 1 ) .

Recognizability of finite groups by Suzuki group

Alireza Khalili Asboei, Seyed Sadegh Salehi Amiri (2019)

Archivum Mathematicum

Similarity:

Let G be a finite group. The main supergraph 𝒮 ( G ) is a graph with vertex set G in which two vertices x and y are adjacent if and only if o ( x ) o ( y ) or o ( y ) o ( x ) . In this paper, we will show that G S z ( q ) if and only if 𝒮 ( G ) 𝒮 ( S z ( q ) ) , where q = 2 2 m + 1 8 .

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G 1 and G 2 be two given graphs. The Ramsey number R ( G 1 , G 2 ) is the least integer r such that for every graph G on r vertices, either G contains a G 1 or G ¯ contains a G 2 . Parsons gave a recursive formula to determine the values of R ( P n , K 1 , m ) , where P n is a path on n vertices and K 1 , m is a star on m + 1 vertices. In this note, we study the Ramsey numbers R ( P n , K 1 F m ) , where F m is a linear forest on m vertices. We determine the exact values of R ( P n , K 1 F m ) for the cases m n and m 2 n , and for the case that F m has no odd component. Moreover, we...

The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths

Halina Bielak, Kinga Dąbrowska (2015)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

The Ramsey number R ( G , H ) for a pair of graphs G and H is defined as the smallest integer n such that, for any graph F on n vertices, either F contains G or F ¯ contains H as a subgraph, where F ¯ denotes the complement of F . We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers R ( K 1 + L n , P m ) and R ( K 1 + L n , C m ) for some integers m , n , where L n is...

S -depth on Z D -modules and local cohomology

Morteza Lotfi Parsa (2021)

Czechoslovak Mathematical Journal

Similarity:

Let R be a Noetherian ring, and I and J be two ideals of R . Let S be a Serre subcategory of the category of R -modules satisfying the condition C I and M be a Z D -module. As a generalization of the S - depth ( I , M ) and depth ( I , J , M ) , the S - depth of ( I , J ) on M is defined as S - depth ( I , J , M ) = inf { S - depth ( 𝔞 , M ) : 𝔞 W ˜ ( I , J ) } , and some properties of this concept are investigated. The relations between S - depth ( I , J , M ) and H I , J i ( M ) are studied, and it is proved that S - depth ( I , J , M ) = inf { i : H I , J i ( M ) S } , where S is a Serre subcategory closed under taking injective hulls. Some conditions are provided that local cohomology...