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

推荐订阅源

OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Hugging Face - Blog
Hugging Face - Blog
F
Fortinet All Blogs
G
Google Developers Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
V2EX
Y
Y Combinator Blog
博客园_首页
Martin Fowler
Martin Fowler
博客园 - 司徒正美
MyScale Blog
MyScale Blog
宝玉的分享
宝玉的分享
B
Blog
有赞技术团队
有赞技术团队
A
About on SuperTechFans
量子位
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
酷 壳 – CoolShell
酷 壳 – CoolShell
Apple Machine Learning Research
Apple Machine Learning Research
M
MIT News - Artificial intelligence
阮一峰的网络日志
阮一峰的网络日志
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}}$
Determinant and Pfaffian formulas for particle annihilation
[Submitted on 13 Feb 2026 (v1), last revised 14 Jul 2026 (this v · 2026-02-14 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:We consider systems of particles on a line in which colliding particles annihilate each other and vanish. Computing exact annihilation probabilities is difficult because every collision reduces the particle count, while determinantal methods require a fixed count throughout. The ghost particle method, introduced in a companion paper for coalescence, removes the obstacle: destroyed particles continue walking as invisible ghosts, so the number of trajectories never changes. Applied to annihilation, the method yields an exact determinantal formula for the probability of any prescribed outcome - the number of annihilations, the survivor positions, and the positions of the ghosts. For complete annihilation, where no particle survives, the determinant collapses to a Pfaffian, an algebraic relative of the determinant built from pairwise quantities: although the particles interact, the extinction probability is determined by pairwise annihilation probabilities alone. This gives a combinatorial explanation of the Pfaffian structure of annihilating systems, previously derived through differential equations for specific dynamics. The annihilation formula also yields results about coalescence: the event that prescribed pairs of particles have merged can be reinterpreted as complete annihilation, producing a Pfaffian coalescence formula. All formulas are exact for any finite initial configuration and apply to discrete lattice paths, birth-death chains, and continuous diffusions including Brownian motion.

Submission history

From: Piotr Śniady [view email]
[v1] Fri, 13 Feb 2026 18:48:01 UTC (35 KB)
[v2] Mon, 9 Mar 2026 13:50:14 UTC (35 KB)
[v3] Tue, 14 Jul 2026 10:10:07 UTC (57 KB)