Face Numbers of Shellable CW Balls and Spheres

Joshua Hinman
{"title":"Face Numbers of Shellable CW Balls and Spheres","authors":"Joshua Hinman","doi":"arxiv-2409.08427","DOIUrl":null,"url":null,"abstract":"Let $\\mathscr{X}$ be the boundary complex of a $(d+1)$-polytope, and let\n$\\rho(d+1,k) = \\frac{1}{2}[{\\lceil (d+1)/2 \\rceil \\choose d-k} + {\\lfloor\n(d+1)/2 \\rfloor \\choose d-k}]$. Recently, the author, answering B\\'ar\\'any's\nquestion from 1998, proved that for all $\\lfloor \\frac{d-1}{2} \\rfloor \\leq k\n\\leq d$, \\[ f_k(\\mathscr{X}) \\geq \\rho(d+1,k)f_d(\\mathscr{X}). \\] We prove a\ngeneralization: if $\\mathscr{X}$ is a shellable, strongly regular CW sphere or\nCW ball of dimension $d$, then for all $\\lfloor \\frac{d-1}{2} \\rfloor \\leq k\n\\leq d$, \\[ f_k(\\mathscr{X}) \\geq \\rho(d+1,k)f_d(\\mathscr{X}) + \\frac{1}{2}f_k(\\partial\n\\mathscr{X}), \\] with equality precisely when $k=d$ or when $k=d-1$ and\n$\\mathscr{X}$ is simplicial. We further prove that if $\\mathscr{S}$ is a\nstrongly regular CW sphere of dimension $d$, and the face poset of\n$\\mathscr{S}$ is both CL-shellable and dual CL-shellable, then\n$f_k(\\mathscr{S}) \\geq \\min\\{f_0(\\mathscr{S}),f_d(\\mathscr{S})\\}$ for all $0\n\\leq k \\leq d$.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"31 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Let $\mathscr{X}$ be the boundary complex of a $(d+1)$-polytope, and let $\rho(d+1,k) = \frac{1}{2}[{\lceil (d+1)/2 \rceil \choose d-k} + {\lfloor (d+1)/2 \rfloor \choose d-k}]$. Recently, the author, answering B\'ar\'any's question from 1998, proved that for all $\lfloor \frac{d-1}{2} \rfloor \leq k \leq d$, \[ f_k(\mathscr{X}) \geq \rho(d+1,k)f_d(\mathscr{X}). \] We prove a generalization: if $\mathscr{X}$ is a shellable, strongly regular CW sphere or CW ball of dimension $d$, then for all $\lfloor \frac{d-1}{2} \rfloor \leq k \leq d$, \[ f_k(\mathscr{X}) \geq \rho(d+1,k)f_d(\mathscr{X}) + \frac{1}{2}f_k(\partial \mathscr{X}), \] with equality precisely when $k=d$ or when $k=d-1$ and $\mathscr{X}$ is simplicial. We further prove that if $\mathscr{S}$ is a strongly regular CW sphere of dimension $d$, and the face poset of $\mathscr{S}$ is both CL-shellable and dual CL-shellable, then $f_k(\mathscr{S}) \geq \min\{f_0(\mathscr{S}),f_d(\mathscr{S})\}$ for all $0 \leq k \leq d$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可脱壳 CW 球和球体的面数
让 $\mathscr{X}$ 是一个 $(d+1)$ 多面体的边界复数,并让 $\rho(d+1,k) = (frac{1}{2}[{/lceil (d+1)/2 \rceil \choose d-k} + {\lfloor(d+1)/2 \rfloor \choose d-k}]$.最近,作者在回答1998年的问题时,证明了对于所有的 $\lfloor \frac{d-1}{2}f_k(\mathscr{X}) \geq \rho(d+1,k)f_d(\mathscr{X})。 我们证明了一个概括:如果 $\mathscr{X}$ 是一个可壳的、强正则的 CW 球或维数为 $d$ 的 CW 球,那么对于所有 $\lfloor \frac{d-1}{2} 的 $\lfloor \leq k\leq d$,[ f_k(\mathscr{X}) \geq \rho(d+1,k)f_d(\mathscr{X})。\f_k(\mathscr{X}) \geq \rho(d+1,k)f_d(\mathscr{X}) + \frac{1}{2}f_k(\partial\mathscr{X}), \]恰好在 $k=d$ 或 $k=d-1$ 且$\mathscr{X}$是简单时是相等的。我们进一步证明,如果 $\mathscr{S}$ 是维数为 $d$ 的强正则 CW 球,并且 $\mathscr{S}$ 的面正集既是 CL 可壳的,又是对偶 CL 可壳的、then$f_k(\mathscr{S}) \geq \min\{f_0(\mathscr{S}),f_d(\mathscr{S})\}$ for all $0\leq k \leq d$.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1