2021
DOI: 10.48550/arxiv.2107.06742
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A note on almost Cohen-Macaulay monomial ideals

Abstract: Let R = k[x1, . . . , xn] be the polynomial ring in n variables over a field k and let I be a monomial ideal of R. In this paper, we study almost Cohen-Macaulay simplicial complex. Moreover, we characterize the almost Cohen-Macaulay polymatroidal Veronese type and transversal polymatroidal ideals and furthermore we give some examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…, F m be the simplicial complex of independent sets of G. By Lemma 2.1 we have lk ∆ {x n } and lk ∆ {y n } are the simplicial complexs of independent sets of H and K respectively. Therefore by [18,Corollary 3.6], H and K are aCM.…”
Section: Theorem 29 Let G Be An Unmixed Bipartite Graph With Bipartitionmentioning
confidence: 96%
See 4 more Smart Citations
“…, F m be the simplicial complex of independent sets of G. By Lemma 2.1 we have lk ∆ {x n } and lk ∆ {y n } are the simplicial complexs of independent sets of H and K respectively. Therefore by [18,Corollary 3.6], H and K are aCM.…”
Section: Theorem 29 Let G Be An Unmixed Bipartite Graph With Bipartitionmentioning
confidence: 96%
“…Proof. Let H = G \ {u, v, w} be subgraph of G, by Lemma 2.1 we have lk ∆ {u} is the simplicial complexs of independent sets of H. By [18,Corollary 3.6], lk ∆ {u} is aCM. If Γ = F 1 , .…”
Section: Theorem 23 Let G Be An Acm Bipartite Graph With Bipartitionmentioning
confidence: 99%
See 3 more Smart Citations