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

推荐订阅源

F
Fortinet All Blogs
爱范儿
爱范儿
V
Visual Studio Blog
Engineering at Meta
Engineering at Meta
B
Blog
云风的 BLOG
云风的 BLOG
G
Google Developers Blog
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
WordPress大学
WordPress大学
D
DataBreaches.Net
B
Blog RSS Feed
小众软件
小众软件
人人都是产品经理
人人都是产品经理
I
InfoQ
P
Proofpoint News Feed
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
J
Java Code Geeks
The GitHub Blog
The GitHub Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

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}}$
The Serre depth of Stanley-Reisner rings and the depth of...
Yuji Muta, Naoki Terai · 2025-09-18 · via math.CO updates on arXiv.org

We investigate an invariant, called the Serre depth, from the perspective of combinatorial commutative algebra. In this paper, we establish several properties of an analogue of the depth of Stanley-Reisner rings. In particular, we relate the Serre depth both to the minimal free resolution of a Stanley-Reisner ring and to that of its Alexander dual. Also, we establish an analogue of a known result that describes the depth of Stanley-Reisner rings in terms of skeletons. Moreover, we study the Serre depth for $(S_{2})$ and the depth on the symbolic powers of Stanley--Reisner ideals. It had been an open question whether the depth of the symbolic powers of Stanley-Reisner ideals satisfies a non-increasing property, but Nguyen and Trung provided a negative answer. We construct an example that the Serre depth for $(S_{2})$ and the depth do not satisfy this property and its second symbolic power is Cohen-Macaulay. Moreover, we prove that the sequence of the Serre depth for $(S_{2})$ on the symbolic powers is convergent and that its limit coincides with the minimum value. Finally, we study the Serre depth on edge and cover ideals. Whether the depth on symbolic powers of edge ideals satisfies a non-increasing property has remained an open question. We address a related problem and show that the Serre depth for $(S_{2})$ on edge ideals of any well-covered graph satisfies a non-increasing property. In addition, we prove that the Serre depth for $(S_{2})$ on the cover ideals of any graph also satisfies a non-increasing property. Moreover, we determine the Serre depth on edge ideals of very well-covered graphs.