arXiv math/07034592007-03-15math.ACmath.CO

Odd-Cycle-Free Facet Complexes and the König property

Massimo Caboara, Sara Faridi

备注：: 12 pages, 11 figures

英文摘要：

We use the definition of a simplicial cycle to define an odd-cycle-free facet complex (hypergraph). These are facet complexes that do not contain any cycles of odd length. We show that besides one class of such facet complexes, all of them satisfy the König property. This new family of complexes includes the family of balanced hypergraphs, which are known to satisfy the König property. These facet complexes are, however, not Mengerian; we give an example to demonstrate this fact.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The facet ideals of matching complexes of line graphs

Let $L_n$ be a line graph with $n$ edges and $\F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $\F(L_n)$ and some exact formulas for the projective dimension and the regularity of $\F(L_n)$.

2021-08-06math.ACmath.CO

关于简单复形的行列式面理想格基的基础

Grobner bases for determinantal facet ideals of simplicial complexes

本文研究了简单复形行列式面理想在对角术语序下具有约简格基的条件，引入了强闭合和贫闭合概念，并修正了相关格基特征化结果。

2026-01-26math.ACmath.CO

Hamiltonian paths, unit-interval complexes, and determinantal facet ideals

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient conditions for a graph to be Hamiltonian. We introduce a hierarchy of combinatorial properties for simplicial complexes that generalize unit-interval, interval, and co-comparability graphs. We connect these properties to the already existing notions of determinantal facet ideals and Hamiltonian paths in simplicial complexes. Some important consequences of our…

2021-04-12math.ACmath.CO

The facet ideals of chessboard complexes

In this paper we describe the irreducible decomposition of the facet ideal $\F(Δ_{m,n})$ of the chessboard complex $Δ_{m,n}$ with $n\geq m$. We also provide some lower bounds for depth and regularity of the facet ideal $\F(Δ_{m,n})$. When $m\leq 3$, we prove that these lower bounds can be obtained.

2022-09-26math.AC

Trimming Complexes and Applications to Resolutions of Determinantal Facet Ideals

We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set for an arbitrary ideal $I$. In particular, we compute the Betti table for removing an arbitrary generator from the ideal of submaximal pfaffians of a generic skew symmetric matrix $M$. We also explicitly compute the Betti table for the ideal generated by certain subsets of the generating set of the ideal of maximal minors of a generic $n \times m$ matrix. S…

2020-09-16math.AC

具有许多面的单纯复形是顶点可分解的

Simplicial complexes with many facets are vertex decomposable

本文改进 Terai–Yoshida 定理，证明面数达到 $\inom{n}{c}-2c+1$ 的纯单纯复形不仅是 Cohen–Macaulay，更是顶点可分解的，并证明界最优。

2024-10-27math.ACmath.CO

更多相关论文收起更多论文

Cohen-Macaulay Properties of Square-Free Monomial Ideals

In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.

2005-07-12math.ACmath.CO

Resolutions of facet ideals

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determine the projective dimension and the regularity of I if the tree is 1-dimensional, show that the graded Betti numbers of I satisfy an alternating sum property if the tree is connected in codimension 1, …

2003-07-17math.AC

Tableau complexes

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions. In our motivating example, the facets are labeled by semistandard Young tableaux, and the more general interior faces are labeled by Buch's set-valued semistandard tableaux. One vertex decomposition of this "Young tableau complex" parallels Lascoux's transition formula…

2006-03-29math.ACmath.CO

Higher Nerves of Simplicial Complexes

We investigate generalized notions of the nerve complex for the facets of a simplicial complex. We show that the homologies of these higher nerve complexes determine the depth of the Stanley-Reisner ring $k[Δ]$ as well as the $f$-vector and $h$-vector of $Δ$. We present, as an application, a formula for computing regularity of monomial ideals.

2019-01-29math.ACmath.CO

与棋盘复形相关的理想的幂的 $\mathrm{v}$-数

The $\mathrm{v}$-number of powers of ideals associated with chessboard complexes

School of Mathematical Sciences, Soochow University（苏州大学数学科学学院）

本文研究棋盘复形的面理想和Stanley--Reisner理想的普通幂与符号幂的$\mathrm{v}$-数，建立了精确公式，并证明普通幂的$\mathrm{v}$-数函数渐近线性。

2026-09-30math.AC

边添加下非匹配复形的同调及其在Stanley-Reisner理想中的应用

Homology of non-matching complexes under edge additions and applications to their Stanley-Reisner ideals

School of Mathematics and Systems Science, Shenyang Normal University（沈阳师范大学数学与系统科学学院）；School of Mathematical Sciences, Soochow University（苏州大学数学科学学院）

该研究针对二分图的$t$-非匹配复形，证明边添加诱导同调单射，结合模型得到Leray数等结果，还确定了完全二分图对应理想的相关同调性质并解决了一个猜想。

2026-09-03math.AC

Cohen-Macaulay, Shellable and unmixed clutters with a perfect matching of König type

Let $\mathcal{C}$ be a clutter with a perfect matching $e_1,...,e_g$ of König type and let $Δ_\mathcal{C}$ be the Stanley-Reisner complex of the edge ideal of $\mathcal{C}$. If all c-minors of $\mathcal{C}$ have a free vertex and $\mathcal{C}$ is unmixed, we show that $Δ_\mathcal{C}$ is pure shellable. We are able to describe, in combinatorial and algebraic terms, when $Δ_\mathcal{C}$ is pure. If $\mathcal{C}$ has no cycles of length 3 or 4, then it is shown that $Δ_\mathcal{C}$ is pure if and only if $Δ_\mathcal{C}$ is pure shellable (in this case $e_i$ has a free vertex for all $i$), and tha…

2007-11-06math.ACmath.CO