Related papers: Fixed Point Homing Shuffles
We give a simple way to study the isotypical components of the homology of simplicial complexes with actions of finite groups, and use it for Milnor fibers of ICIS. We study the homology of images of mappings $f_t$ that arise as…
We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…
A distributed algorithm is described for finding a common fixed point of a family of m>1 nonlinear maps M_i : R^n -> R^n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed…
Let W be a planar 3-web defined on a neighborhood of a point M. We call "symmetry of W around M" any local diffeomorphism which fixes M and maps each foliation of W to a (not necessarily the same) foliation of W. We say that it is a simple…
In this paper, we study the behavior of the local Floer homology of an isolated fixed point and the growth of the action gap under iterations. To be more specific, we prove that an isolated fixed point of a Hamiltonian diffeomorphism…
How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…
In this paper, we study some cards shuffles which are used by magicians. We focus ourselves on the possibility to hit eventually the initial state after several shuffles. This is a classical problem arising in discrete dynamical systems.…
Central configurations play an important role in the dynamics of the $n$-body problem: they occur as relative equilibria and as asymptotic configurations in colliding trajectories. We illustrate how they can be found as projective fixed…
A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…
We introduce the stack-sorting map $\text{SC}_\sigma$ that sorts, in a right-greedy manner, an input permutation through a stack that avoids some vincular pattern $\sigma$. The stack-sorting maps of Cerbai et al. in which the stack avoids a…
We consider commuting pairs of holomorphic endomorphisms of P^2 with disjoint sequence of iterates. The remaining case to be studied is when their degrees coincide after some number of iterations. We show in this case that they are either…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
Persistent homology is an important methodology in topological data analysis which adapts theory from algebraic topology to data settings. Computing persistent homology produces persistence diagrams, which have been successfully used in…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by…
A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically…
Graph matching---aligning a pair of graphs to minimize their edge disagreements---has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and…
Let $\mathcal{L}$ be a knot with a fixed positive crossing and $\mathcal{L}_n$ the link obtained by replacing this crossing with $n$ positive twists. We prove that the knot Floer homology $\widehat{\text{HFK}}(\mathcal{L}_n)$ `stabilizes'…
We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…