A note on Zeilberger's abstract lace expansion (Q696863): Difference between revisions

\textit{D. Zeilberger} [Adv. Appl. Math. 19, 355-359 (1997; Zbl 0882.05006)] showed that lace expansion yields some sieves, including the ordinary inclusion-exclusion, and the Brun sieve, in addition to the original lace expansion of \textit{D. Brydges} and \textit{T. Spencer} [Commun. Math. Phys. 97, 125-148 (1985; Zbl 0575.60099)]. The paper in review shows how a convex geometry (dual antimatroid) gives rise to a lace map. Several other sieves are derived using lace maps: the inclusion-exclusion principle on semilattices of \textit{H. Narushima} [J. Comb. Theory, Ser. A 17, 196-203 (1974; Zbl 0289.05013)], the tree sieve of \textit{D. Q. Naiman} and \textit{H. P. Wynn} [Ann. Stat. 20, 43-76 (1992; Zbl 0752.62028)], the broken circuit theorem on the chromatic polynomial of a graph from \textit{H. Whitney} [Bull. Am. Math. Soc. 38, 572-579 (1932; Zbl 0005.14602)].