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

推荐订阅源

Microsoft Security Blog
Microsoft Security Blog
Apple Machine Learning Research
Apple Machine Learning Research
美团技术团队
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
G
Google Developers Blog
阮一峰的网络日志
阮一峰的网络日志
The Cloudflare Blog
J
Java Code Geeks
Martin Fowler
Martin Fowler
M
MIT News - Artificial intelligence
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
月光博客
月光博客
Google DeepMind News
Google DeepMind News
小众软件
小众软件
V
V2EX
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
腾讯CDC
B
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}}$
The graded Betti numbers of truncation of ideals in polyn...
Chwas Ahmed, Ralf Fröberg, Mohammed Rafiq Namiq · 2022-09-19 · via math.CO updates on arXiv.org

Let $R=\mathbb{K}[x_1,\dots,x_n]$, a graded algebra $S=R/I$ satisfies $N_{k,p}$ if $I$ is generated in degree $k$, and the graded minimal resolution is linear the first $p$ steps, and the $k$-index of $S$ is the largest $p$ such that $S$ satisfies $N_{k,p}$. Eisenbud and Goto have shown that for any graded ring $R/I$, then $R/I_{\geq k}$, where $I_{\geq k}=I\cap M^k$ and $M=(x_1,\dots,x_n)$, has a $k$-linear resolution (satisfies $N_{k,p}$ for all $p$) if $k\gg0$. For a squarefree monomial ideal $I$, we are here interested in the ideal $I_k$ which is the squarefree part of $I_{\geq k}$. The ideal $I$ is, via Stanley-Reisner correspondence, associated to a simplicial complex $Δ_I$. In this case, all Betti numbers of $R/I_k$ for $k>\min\{\text{deg}(u)\mid u\in I\}$, which of course is a much finer invariant than the index, can be determined from the Betti diagram of $R/I$ and the $f$-vector of $Δ_I$. We compare our results with the corresponding statements for $I_{\ge k}$. (Here $I$ is an arbitrary graded ideal.) In this case we show that the Betti numbers of $R/I_{\ge k}$ can be determined from the Betti numbers of $R/I$ and the Hilbert series of $R/I_{\ge k}$.