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

推荐订阅源

Google DeepMind News
Google DeepMind News
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
J
Java Code Geeks
D
DataBreaches.Net
B
Blog RSS Feed
D
Docker
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
F
Fortinet All Blogs
Y
Y Combinator Blog
A
About on SuperTechFans
V
V2EX
罗磊的独立博客
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
MongoDB | Blog
MongoDB | Blog
博客园 - 【当耐特】
Last Week in AI
Last Week in AI
S
SegmentFault 最新的问题
月光博客
月光博客
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
阮一峰的网络日志
阮一峰的网络日志

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}}$
On the homological shifts of cover ideals of Cohen-Macaul...
Amit Roy, Kamalesh Saha · 2025-06-02 · via math.CO updates on arXiv.org

For a non-negative integer $k$, let $\mathrm{HS}_{k}(J(G))$ denote the $k^{\text{th}}$ homological shift ideal of the vertex cover ideal $J(G)$ of a graph $G$. For each $k\geq 2$, we construct a Cohen-Macaulay very well-covered graph $G_k$ which is both Cohen-Macaulay bipartite and a whiskered graph so that $\mathrm{HS}_{k}(J(G))$ does not have a linear resolution. This contradicts several results as well as disproves a conjecture in [J. Algebra, $\mathbf{629}$, (2023), 76-108] and [Mediterr. J. Math., $\mathbf{21}$, 135 (2024)]. The graphs $G_k$ are also examples of clique-whiskered graphs introduced by Cook and Nagel, which include Cohen-Macaulay chordal graphs, Cohen-Macaulay Cameron-Walker graphs, and clique corona graphs. Surprisingly, for Cohen-Macaulay chordal graphs, we can use a special ordering on the minimal generators to show that $\mathrm{HS}_{k}(J(G))$ has linear quotients for all $k$. Moreover, for all Cohen-Macaulay Cameron-Walker graphs and certain clique corona graphs, we show that $\mathrm{HS}_{k}(J(G))$ is weakly polymatroidal, and thus, has linear quotients for all $k$.