惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

爱范儿
爱范儿
T
The Blog of Author Tim Ferriss
G
Google Developers Blog
博客园_首页
博客园 - 【当耐特】
量子位
S
SegmentFault 最新的问题
B
Blog RSS Feed
酷 壳 – CoolShell
酷 壳 – CoolShell
V
Visual Studio Blog
T
Tailwind CSS Blog
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
Y
Y Combinator Blog
博客园 - 聂微东
The Cloudflare Blog
小众软件
小众软件
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
H
Help Net Security
Jina AI
Jina AI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
宝玉的分享
宝玉的分享

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Complexes of C-Unbalanced Subsets and Balanced-Subset Posets
[Submitted on 9 Dec 2025 (v1), last revised 28 Aug 2026 (this ve · 2025-12-09 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let \(V=\{v_1,\dots,v_m\}\subset\mathbb{R}^d\). We study simplicial complexes arising from subsets of \(V\) whose convex hulls avoid a prescribed convex set. Given a convex set \(C\subset\mathbb{R}^d\), let \(\mathcal K(V,C)\) be the simplicial complex consisting of all subsets \(S\subset V\) such that \(\operatorname{conv}(S)\cap C=\emptyset\). We prove that \(\mathcal K(V,C)\) is homotopy equivalent to the union of the faces of \(\operatorname{conv}(V)\) that are disjoint from \(C\). In the special case \(C=\{r\}\), subsets \(S\) satisfying \(r\in\operatorname{conv}(S)\) are called weakly \(r\)-balanced. If \(r\in\operatorname{relint}\operatorname{conv}(V)\) and the poset of proper weakly \(r\)-balanced subsets is nonempty, then its order complex is homotopy equivalent to the sphere \(S^{m-k-2}\), where \(k=\dim\operatorname{aff}(V)\).

Submission history

From: Mikhail Bludov V [view email]
[v1] Tue, 9 Dec 2025 15:21:58 UTC (14 KB)
[v2] Fri, 28 Aug 2026 05:38:03 UTC (19 KB)