Publication

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

2026

Abstract

We establish a fixed-point theorem for the face maps that consist in deleting the i th 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 $\mathbf{N}$ are discussed in an appendix.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2026

Abstract

Official source

Related concepts (26)

Fixed-point theorem

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. The Banach fixed-point theorem (1922) gives a general criterion guaranteeing that, if it is satisfied, the procedure of iterating a function yields a fixed point.

Brouwer fixed-point theorem

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function mapping a nonempty compact convex set to itself there is a point such that . The simplest forms of Brouwer's theorem are for continuous functions from a closed interval in the real numbers to itself or from a closed disk to itself. A more general form than the latter is for continuous functions from a nonempty convex compact subset of Euclidean space to itself.

Partially ordered set

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, transitive and antisymmetric.

Related publications (3)

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

Chat with Graph Search

Human-in-the-Loop Optimization for Terrain-and User-Adaptive Gait Phase Estimation in Phase-Portrait-Based Methods

Hegemony in institutional transformation. Thesis from a work in progress

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points