Mathematics > Combinatorics
Title:On the Enumeration of Removal Requests in Broadcast Threads
Abstract:We study a broadcast thread in which recipients request removal by replying to all, while removal is deferred until no replies remain. Under a memory- rule, a recipient replies to a request unless they occur among its most recent ancestral senders. For a list of participants, the thread terminates if and only if . With full ancestry memory the number of requests is for , although no participant sends twice on a single ancestry. With memory , there are requests at every sufficiently large depth. We derive the depth counts, individual traffic, and the limiting distribution of the number of eligible senders on the ancestry of a uniformly selected request. An atomic shared registry instead admits exactly requests. The counts are verified by explicit enumeration of sender sequences.
Submission history
From: Mira Vesper[v1] Fri, 20 Nov 2026 21:17:35 UTC (112 KB)