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

推荐订阅源

博客园 - Franky
WordPress大学
WordPress大学
Hugging Face - Blog
Hugging Face - Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
小众软件
小众软件
人人都是产品经理
人人都是产品经理
罗磊的独立博客
博客园 - 聂微东
雷峰网
雷峰网
量子位
美团技术团队
V
V2EX
The GitHub Blog
The GitHub Blog
大猫的无限游戏
大猫的无限游戏
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
IT之家
IT之家
The Cloudflare Blog
爱范儿
爱范儿
T
Tailwind CSS Blog
博客园 - 三生石上(FineUI控件)
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI
Jina AI
Jina AI

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}}$
Causal Edge Rees Algebras for Spatiotemporal Graphs
[Submitted on 17 Apr 2026 (v1), last revised 30 Aug 2026 (this v · 2026-04-18 · via math.CO updates on arXiv.org

This paper has been withdrawn by Marcílio Santos

No PDF available, click to view other formats

Abstract:Understanding the evolution of connectivity in spatiotemporal systems requires mathematical frameworks capable of encoding not only instantaneous interactions but also their cumulative causal structure. In this work, we introduce the \emph{Causal Edge Rees Algebra} (CERA), a new algebraic construction associated with causal spatiotemporal graphs. Given a temporal filtration induced by causal constraints, we associate a sequence of edge ideals whose Rees algebra encodes the full history of connectivity evolution in a single graded object. This construction establishes a bridge between dynamic graph topology and commutative algebra. In particular, we show that successive quotients of the filtration capture the emergence of new structural connections, allowing the identification of critical edges responsible for the fusion of previously disconnected components. This leads to the definition of temporal bridge modules and to a bridge detection theorem, which relates the dimension of these modules to the reduction in the number of connected components over time. Unlike existing algebraic approaches in topological data analysis, which are primarily based on geometric filtrations, the proposed framework is driven by intrinsic causal constraints. As a result, the CERA captures not only topological features but also their temporal organization and mechanisms of coalescence. The theory provides a new algebraic perspective on causal network dynamics, connecting edge ideals, Rees algebras, and temporal graphs. Beyond its theoretical significance, the framework opens new directions for the analysis of spatiotemporal systems, including epidemic networks, transport systems, and information propagation processes.

Submission history

From: Marcílio Santos [view email]
[v1] Fri, 17 Apr 2026 22:27:58 UTC (17 KB)
[v2] Sun, 30 Aug 2026 20:54:41 UTC (1 KB) (withdrawn)