English
Related papers

Related papers: Conditions for Virtually Cohen--Macaulay Simplicia…

200 papers

We present criteria for the Cohen-Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen-Macaulayness of monomial ideals…

Commutative Algebra · Mathematics 2011-03-01 Nguyen Cong Minh , Ngo Viet Trung

We prove that for m > 2, the m-th symbolic power of a Stanley-Reisner ideal is Cohen-Macaulay if and only if the simplicial complex is a matroid. Similarly, the m-th ordinary power is Cohen-Macaulay for some m > 2 if and only if the complex…

Commutative Algebra · Mathematics 2010-09-07 Naoki Terai , Ngo Viet Trung

Let $(R,\fm)$ be a local ring and $C$ be a homologically bounded and finitely generated $R$-complex. Then, we prove that $C$ is a dualizing complex of $R$ if and only if $C$ is a Cohen-Macaulay semidualizing complex of type one or…

Commutative Algebra · Mathematics 2023-05-18 Majid Rahro Zargar

We determine the simplicial compleses $\Delta$ whose Stanley-Reisner ideals $I_\Delta$ have the following property: for all $n\geq 1$ the powers $I_\Delta^n$ have linear resolutions and finite length local cohomologies.

Commutative Algebra · Mathematics 2013-08-21 Munetaka Okudaira , Yukihide Takayama

Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent…

Commutative Algebra · Mathematics 2012-05-29 Seyyede Masoome Seyyedi , Farhad Rahmati , Mahdis Saeedi

Let A be an integer (d x n) matrix, and assume that the convex hull conv(A) of its columns is a simplex of dimension d-1. Write \NA for the semigroup generated by the columns of A. It was proved by M. Saito [math.AG/0012257] that the…

Commutative Algebra · Mathematics 2007-05-23 Laura Felicia Matusevich , Ezra Miller

We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some…

Combinatorics · Mathematics 2010-10-13 Jonathan Browder

We show that all reduced closed subschemes of projective space that have a Cohen-Macaulay graded coordinate ring are of wild Cohen-Macaulay type, except for a few cases which we completely classify.

Algebraic Geometry · Mathematics 2024-09-04 Daniele Faenzi , Joan Pons-Llopis

We prove that the depth formula holds for $\Tor$-independent modules in certain cases over a Cohen-Macaulay local ring, provided one of the modules has reducible complexity.

Commutative Algebra · Mathematics 2009-09-24 Petter Andreas Bergh , David Jorgensen

This work introduces a notion of complexes of maximal depth, and maximal Cohen-Macaulay complexes, over a commutative noetherian local ring. The existence of such complexes is closely tied to the Hochster's ``homological conjectures", most…

Commutative Algebra · Mathematics 2021-06-16 Srikanth B. Iyengar , Linquan Ma , Karl Schwede , Mark E. Walker

In the simplicial theory of hypercoverings, we replace the indexing category $\Delta$ by the \emph{symmetric simplicial category} $\Delta S$ and study (a class of) $\Delta S$-hypercoverings, which we call \emph{spaces admitting symmetric…

Algebraic Geometry · Mathematics 2023-08-14 Oishee Banerjee

Let $\Delta$ be a connected, pure $2$-dimensional simplicial complex embedded in $\mathbb{R}^2$ and let $C^{r}(\hat{\Delta})$ be the homogenized spline module of $\Delta$ with smoothness $r$. To study $C^{r}(\hat{\Delta})$, Schenck and…

Commutative Algebra · Mathematics 2020-09-23 Beihui Yuan

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

Combinatorics · Mathematics 2015-05-04 Iván Dario Castrillón , Roberto Cruz , Enrique Reyes

In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…

Combinatorics · Mathematics 2019-12-05 Lewis Mead

Given a domain $\Omega \subset \mathbb{R}^n$, the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on $\Omega$, and its discretization helps build stable…

Numerical Analysis · Mathematics 2022-09-07 Kendrick Shepherd , Deepesh Toshniwal

We study the minimal free resolution of the Veronese modules of the polynomial ring in n variables, by giving a formula for the Betti numbers in terms of the reduced homology of some skeleton of a simplicial complex. We characterize when…

Commutative Algebra · Mathematics 2014-10-28 Ornella Greco , Ivan Martino

We extend the notion of face rings of simplicial complexes and simplicial posets to the case of finite-length (possibly infinite) simplicial posets with a group action. The action on the complex induces an action on the face ring, and we…

Combinatorics · Mathematics 2021-11-30 Alessio D'Alì , Emanuele Delucchi

In this paper, we explore the structure of the normal Sally modules of rank one with respect to an $m$-primary ideal in a Nagata reduced local ring which is not necessary Cohen-Macaulay. As an application of this result, when the base ring…

Commutative Algebra · Mathematics 2017-07-06 Phuong Tran Thi

A normal (respectively, graded normal) vector configuration $A$ defines the toric ideal $I_A$ of a normal (respectively, projectively normal) toric variety. These ideals are Cohen-Macaulay, and when $A$ is normal and graded, $I_A$ is…

Commutative Algebra · Mathematics 2007-05-23 Edwin O'Shea , Rekha R. Thomas

A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…

Logic in Computer Science · Computer Science 2015-07-01 Konrad Burnik , Zvonko Iljazovic