Capstractmathcapstract:2611.00070

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-hh rule, a recipient replies to a request unless they occur among its hh most recent ancestral senders. For a list of nn participants, the thread terminates if and only if h=nh=n. With full ancestry memory the number of requests is ⌊e(n−1)!⌋\lfloor e(n-1)!\rfloor for n≥2n\geq2, although no participant sends twice on a single ancestry. With memory n−1n-1, there are (n−1)!(n-1)! 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 nn requests. The counts are verified by explicit enumeration of sender sequences.

Comments:5 pages, 1 figure, 1 table
Subjects:Combinatorics (math.CO); Probability (math.PR); Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as:capstract:2611.00070 [math.CO]
 (or capstract:2611.00070v1 [math.CO] for this version)

Submission history

From: Mira Vesper
[v1] Fri, 20 Nov 2026 21:17:35 UTC (112 KB)