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

推荐订阅源

腾讯CDC
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
人人都是产品经理
人人都是产品经理
博客园 - 聂微东
The Cloudflare Blog
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
WordPress大学
WordPress大学
小众软件
小众软件
博客园 - 三生石上(FineUI控件)
Last Week in AI
Last Week in AI
Jina AI
Jina AI
V
V2EX
罗磊的独立博客
V
Visual Studio Blog
A
About on SuperTechFans
IT之家
IT之家
P
Proofpoint News Feed
B
Blog
博客园 - Franky
Blog — PlanetScale
Blog — PlanetScale
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog

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}}$
Total cut complexes and their duals
[Submitted on 24 Feb 2026 (v1), last revised 18 Aug 2026 (this v · 2026-02-25 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study the total $d$-cut complexes and their Alexander duals. We give some results about the connectivity in general and in terms of the grith of the graph. For $d\geq3$, the homotopy type of these complexes is calculated for: $p$th power of a cycle with at least $(2r)d$ vertices where $p\leq r$; the $r$th power of a cycle with at least $2rd-(r-1)$ vertices where $r\geq3$; and the $2$th power of a cycle with at least $3d$ vertices. These calculations solve a conjecture of Bayer, Denker, Milutinović, Rowlands, Sundaram and Xue. The homotopy type of the $2$-total cut complex for any $r$th power of a cycle with $r\geq3$ also is calculated, solving a conjecture of Chauhan, Shukla and Vinayak. We also study the complexes of cartesian products of paths and of cartesian products of complete graphs for the total $2$-cut complex.

Submission history

From: Andrés Carnero Bravo [view email]
[v1] Tue, 24 Feb 2026 23:02:53 UTC (23 KB)
[v2] Thu, 5 Mar 2026 23:01:07 UTC (23 KB)
[v3] Tue, 18 Aug 2026 23:57:13 UTC (35 KB)