A fixed-point theorem for face maps, or deletion-tolerant random finite sets

Abstract

We establish a fixed-point theorem for the face maps that consist in deleting the ith entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions. Consequences for various monoids of order-preserving transformations of N are discussed in an appendix.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…