arXiv 0806.42132008-06-25math.CO

The Charney-Davis conjecture for certain subdivisions of spheres

Andrew Frohmader

英文摘要：

Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced, and some of their basic properties are verified. The Charney-Davis conjecture is then proven for odd iterated stellar subdivisions of sesquiconstructible balls and spheres.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Odd-dimensional Charney-Davis conjecture

More than once we have heard that the Charney-Davis Conjecture makes sense only for odd-dimensional spheres. This is to point out that in fact it is also a statement about even-dimensional spheres.

2009-05-12math.CO

On a Generalization of the Flag Complex Conjecture of Charney and Davis

The Flag Complex Conjecture of Charney and Davis states that for a simplicial complex $S$ which triangulates a $(2n - 1)$-generalized homology sphere as a flag complex one has $(-1)^n \sum_{σ\in S} \left(\frac{-1}{2}\right)^{\dimσ+ 1} \ge 0$, where the sum runs over all simplices $σ$ of $S$ (including the empty simplex). Interpreting the $1$-skeleta of $σ\in S$ as graphs of Coxeter groups, we present a stronger version of this conjecture, and prove the equivalence of the latter to the Flag Complex Conjecture.

2010-09-06math.CO

Sign-graded posets, unimodality of $W$-polynomials and the Charney-Davis Conjecture

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the $W$-polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for graded posets by associating a simplicial polytopal sphere to each graded poset $P$. By proving that the $W$-polynomials of sign-graded posets has the right sign at -1, we are able to prove the Charney-Davis Conjecture for these spheres (whenever they are flag).

2004-07-12math.CO

Trung's Construction and the Charney-Davis Conjecture

We consider a construction by which we obtain a simple graph $\mathrm{T}(H,v)$ from a simple graph $H$ and a non-isolated vertex $v$ of $H$. We call this construction "Trung's construction". We prove that $\mathrm{T}(H,v)$ is well-covered, W$_2$ or Gorenstein if and only if $H$ is so. Also we present a formula for computing the independence polynomial of $\mathrm{T}(H,v)$ and investigate when $\mathrm{T}(H,v)$ satisfies the Charney-Davis conjecture. As a consequence of our results, we show that every Gorenstein planar graph with girth at least four, satisfies the Charney-Davis conjecture.

2019-06-27math.ACmath.CO

Face enumeration on flag complexes and flag spheres

We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures including the Charney-Davis conjecture and Gal's conjecture, and the upper bound conjecture for flag spheres and pseudomanifolds.

2018-11-20math.CO

Flag subdivisions and $γ$-vectors

The $γ$-vector is an important enumerative invariant of a flag simplicial homology sphere. It has been conjectured by Gal that this vector is nonnegative for every such sphere $Δ$ and by Reiner, Postnikov and Williams that it increases when $Δ$ is replaced by any flag simplicial homology sphere which geometrically subdivides $Δ$. Using the nonnegativity of the $γ$-vector in dimension 3, proved by Davis and Okun, as well as Stanley's theory of simplicial subdivisions and local $h$-vectors, the latter conjecture is confirmed in this paper in dimensions 3 and 4.

2012-06-06math.CO

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

一个无合法系统的四连通图

A Four-Connected Graph without a Legal System

Department of Computer Science, Shanghai Jiao Tong University（上海交通大学计算机系）

本文构造了一个33顶点、4正则且4连通的图，围长为4，Charney-Davis曲率为1，无合法系统，解决了Jankiewicz等人提出的问题，关键利用限制定理保持障碍。

2026-09-15cs.DMmath.CO