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

推荐订阅源

大猫的无限游戏
大猫的无限游戏
D
DataBreaches.Net
M
MIT News - Artificial intelligence
量子位
N
Netflix TechBlog - Medium
The Cloudflare Blog
The GitHub Blog
The GitHub Blog
P
Proofpoint News Feed
人人都是产品经理
人人都是产品经理
B
Blog RSS Feed
B
Blog
博客园_首页
博客园 - Franky
MyScale Blog
MyScale Blog
有赞技术团队
有赞技术团队
Apple Machine Learning Research
Apple Machine Learning Research
MongoDB | Blog
MongoDB | Blog
云风的 BLOG
云风的 BLOG
爱范儿
爱范儿
H
Help Net Security
Y
Y Combinator Blog
Stack Overflow Blog
Stack Overflow Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
酷 壳 – CoolShell
酷 壳 – CoolShell

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}}$
Stanley-Reisner ideals of higher independence complexes o...
Kanoy Kumar Das, Amit Roy, Kamalesh Saha · 2025-01-02 · via math.CO updates on arXiv.org

For $t\geq 2$, the $t$-independence complex $\mathrm{Ind}_t(G)$ of a graph $G$ is the collection of all $A\subseteq V(G)$ such that each connected component of the induced subgraph $G[A]$ has at most $t-1$ vertices. The topology of $\mathrm{Ind}_t(G)$ is intimately related to the combinatorial property of $G$. In this article, we consider the Stanley-Reisner ideal $J_{t}(G)$ of $\mathrm{Ind}_t(G)$ and focus on its algebraic properties. We prove that for a chordal graph $G$ and for all $t$ \[ \mathrm{reg}(R/J_{t}(G))=(t-1)ν_{t}(G) \text{ and } \mathrm{pd}(R/J_{t}(G))=\mathrm{bight}(J_{t}(G)), \] where $ν_{t}(G)$ denotes the induced matching number of the corresponding hypergraph of $J_{t}(G)$, and $\mathrm{reg}$, $\mathrm{pd}$ and $\mathrm{bight}$ stand for the regularity, projective dimension, and big height, respectively. As a consequence of the above results, we combinatorially characterize when the Stanley-Reisner ideal of the $t$-independence complex of a chordal graph has a linear resolution as well as when it satisfies the Cohen-Macaulay property. The above formulas and their consequences can be seen as a nice generalization of the classical results corresponding to the edge ideals of chordal graphs.