Michael Farber
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Michael Farber has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Shmuel Weinberger
Department of Mathematics, University of Chicago, Chicago, USA
7 shared publications - John Oprea
Department of Mathematics, Cleveland State University, Cleveland, USA
6 shared publications - Amit Kumar Paul
Stat-Math Unit, Indian Statistical Institute, Kolkata, India
5 shared publications - Daniel C. Cohen
Louisiana State University
5 shared publications - Chaim Even-Zohar
The Alan Turing Institute The Alan Turing Institute British Library 96 Euston Road NW1 2DB London UK
3 shared publications - Lewis Mead
School of Mathematical Sciences, Queen Mary University of London, London, UK
3 shared publications
Latest Publications
- 28 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 10 (4) , 683-706
Autonomous Motion in Changing Environments: Fibrations and Reaction Mechanisms
In this paper, we develop further the formalism of fibrations of configuration spaces as a tool for modeling the motion of autonomous systems in variable environments. We analyze the situations when the external conditions may change during the motion of the system and analyze two possibilities: (a) the behavior of the external conditions is known in advance; and (b) the future changes in the external conditions are unknown, but we can measure the current state and the current velocity of the external conditions at every moment of time. We prove that in case (a), the complexity of the motion algorithm is the same as in the case of constant external conditions. In case (b), we introduce a new concept of a reaction mechanism that allows for taking into account unexpected and unpredictable changes in the environment. A reaction mechanism is mathematically an infinitesimal lifting function on a fiber bundle, a nonlinear generalization of the classical concept of an Ehresmann connection. We illustrate these notions by examples which show that nonlinear infinitesimal lifting function (reaction mechanisms) appear naturally and are inevitable and ubiquitous.
- 28 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 10 (4) , 683-706
Autonomous Motion in Changing Environments: Fibrations and Reaction Mechanisms
In this paper, we develop further the formalism of fibrations of configuration spaces as a tool for modeling the motion of autonomous systems in variable environments. We analyze the situations when the external conditions may change during the motion of the system and analyze two possibilities: (a) the behavior of the external conditions is known in advance; and (b) the future changes in the external conditions are unknown, but we can measure the current state and the current velocity of the external conditions at every moment of time. We prove that in case (a), the complexity of the motion algorithm is the same as in the case of constant external conditions. In case (b), we introduce a new concept of a reaction mechanism that allows for taking into account unexpected and unpredictable changes in the environment. A reaction mechanism is mathematically an infinitesimal lifting function on a fiber bundle, a nonlinear generalization of the classical concept of an Ehresmann connection. We illustrate these notions by examples which show that nonlinear infinitesimal lifting function (reaction mechanisms) appear naturally and are inevitable and ubiquitous.
- Open Access
- 3 August 2026
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 10 (3) , 21
Parametrized topological complexity of bundles of real projective spaces, I
In this paper we study parametrized topological complexity of bundles of real projective spaces which arise as projectivisations of vector bundles. We develop algebraic machinery for computing lower bounds for the parametrized topological complexity of projective bundles based on theory of Stiefel - Whitney characteristic classes. We establish sharp upper bounds for the parametrized topological complexity of projective bundles improving the general upper bounds. Combining the lower and the upper bounds we compute explicitly many specific examples.
- 3 August 2026
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 10 (3) , 21
Open AccessParametrized topological complexity of bundles of real projective spaces, I
In this paper we study parametrized topological complexity of bundles of real projective spaces which arise as projectivisations of vector bundles. We develop algebraic machinery for computing lower bounds for the parametrized topological complexity of projective bundles based on theory of Stiefel - Whitney characteristic classes. We establish sharp upper bounds for the parametrized topological complexity of projective bundles improving the general upper bounds. Combining the lower and the upper bounds we compute explicitly many specific examples.
- Open Access
Autonomous motion in changing environment, fibrations and reaction mechanisms
In this paper we develop further the formalism of fibrations of configuration spaces as a tool for modelling motion of autonomous systems in variable environments. We analyse the situations when the external conditions may change during the motion of the system and analyse two possibilities: (a) when the behaviour of the external conditions is known in advance; and (b) when the future changes of the external conditions are unknown but we can measure the current state and the current velocity of the external conditions, at every moment of time. We prove that in the case (a) the complexity of the motion algorithm is the same as in the case of constant external conditions; this generalises the result of \cite{FGY}. In case (b) we introduce a new concept of a reaction mechanism which allows to take into account unexpected and unpredictable changes in the environment. A reaction mechanism is mathematically an infinitesimal lifting function on a fibre bundle, a nonlinear generalisation of the classical concept of an Ehresmann connection. We illustrate these notions by examples which show that nonlinear infinitesimal lifting function (reaction mechanisms) appear naturally, are inevitable and ubiquitous.
Open AccessAutonomous motion in changing environment, fibrations and reaction mechanisms
In this paper we develop further the formalism of fibrations of configuration spaces as a tool for modelling motion of autonomous systems in variable environments. We analyse the situations when the external conditions may change during the motion of the system and analyse two possibilities: (a) when the behaviour of the external conditions is known in advance; and (b) when the future changes of the external conditions are unknown but we can measure the current state and the current velocity of the external conditions, at every moment of time. We prove that in the case (a) the complexity of the motion algorithm is the same as in the case of constant external conditions; this generalises the result of \cite{FGY}. In case (b) we introduce a new concept of a reaction mechanism which allows to take into account unexpected and unpredictable changes in the environment. A reaction mechanism is mathematically an infinitesimal lifting function on a fibre bundle, a nonlinear generalisation of the classical concept of an Ehresmann connection. We illustrate these notions by examples which show that nonlinear infinitesimal lifting function (reaction mechanisms) appear naturally, are inevitable and ubiquitous.
- Open Access
Parametrized topological complexity of bundles of real projective spaces, I
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was computed in the case of the Fadell - Neuwirth bundle which is pertinent to algorithms of collision free motion of many autonomous systems in ${\Bbb R}^d$ avoiding collisions with multiple obstacles. The parametrized topological complexity of sphere bundles was studied in detail in \cite{FW}, \cite{FW2}, \cite{FP}. In this paper we make the next step by studying parametrized topological complexity of bundles of real projective spaces which arise as projectivisations of vector bundles. This leads us to new problems of algebraic topology involving theory of characteristic classes and geometric topology. We establish sharp upper bounds for parametrized topological complexity ${\sf TC}[p:E\to B]$ improving the general upper bounds. We develop algebraic machinery for computing lower bounds for ${\sf TC}[p:E\to B]$ based on the Stiefel - Whitney characteristic classes. Combining the lower and the upper bounds we compute explicitly many specific examples.Open AccessParametrized topological complexity of bundles of real projective spaces, I
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was computed in the case of the Fadell - Neuwirth bundle which is pertinent to algorithms of collision free motion of many autonomous systems in ${\Bbb R}^d$ avoiding collisions with multiple obstacles. The parametrized topological complexity of sphere bundles was studied in detail in \cite{FW}, \cite{FW2}, \cite{FP}. In this paper we make the next step by studying parametrized topological complexity of bundles of real projective spaces which arise as projectivisations of vector bundles. This leads us to new problems of algebraic topology involving theory of characteristic classes and geometric topology. We establish sharp upper bounds for parametrized topological complexity ${\sf TC}[p:E\to B]$ improving the general upper bounds. We develop algebraic machinery for computing lower bounds for ${\sf TC}[p:E\to B]$ based on the Stiefel - Whitney characteristic classes. Combining the lower and the upper bounds we compute explicitly many specific examples. - Open Access
- 9 November 2024
- Published by Springer Nature in Mathematische Annalen
- Vol. 391 (3) , 4555-4605
Sequential topological complexity of aspherical spaces and sectional categories of subgroup inclusions
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the level of fundamental groups. In doing so, we establish new lower bounds on sequential TCs of aspherical spaces as well as the parametrized TC of epimorphisms. Moreover, we generalize the Costa–Farber canonical class for TC to classes for sequential TCs and explore their properties. We combine them with the results on sequential TCs of aspherical spaces to obtain results on spaces that are not necessarily aspherical.
- 9 November 2024
- Published by Springer Nature in Mathematische Annalen
- Vol. 391 (3) , 4555-4605
Open AccessSequential topological complexity of aspherical spaces and sectional categories of subgroup inclusions
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the level of fundamental groups. In doing so, we establish new lower bounds on sequential TCs of aspherical spaces as well as the parametrized TC of epimorphisms. Moreover, we generalize the Costa–Farber canonical class for TC to classes for sequential TCs and explore their properties. We combine them with the results on sequential TCs of aspherical spaces to obtain results on spaces that are not necessarily aspherical.
- Open Access
- 25 September 2024
- Published by Springer Nature in European Journal of Mathematics
- Vol. 10 (4) , 1-29
Sequential parametrized topological complexity of sphere bundles
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm [10] works under variable external conditions and generates continuous motions of the system to attain the prescribed sequence of states at prescribed moments of time. Topological complexity of such algorithms measures their structure and discontinuities. Information about states of the system consistent with states of the external conditions is described by a fibration $$p:E\rightarrow B$$ where the base B parametrizes the external conditions and each fibre $$p^{-1}(b)$$ is the configuration space of the system constrained by external conditions $$b\in B$$ ; more detail on this approach is given below. Our main goal in this paper is to study the sequential topological complexity of sphere bundles $$\dot{\xi }:\dot{E}\rightarrow B$$ ; in other words we study “parametrized families of spheres” and sequential parametrized motion planning algorithms for such bundles. We use the Euler and Stiefel–Whitney characteristic classes to obtain lower bounds on the topological complexity. We illustrate our results by many explicit examples. Some related results for the special case $$r=2$$ were described earlier in [13].- 25 September 2024
- Published by Springer Nature in European Journal of Mathematics
- Vol. 10 (4) , 1-29
Open AccessSequential parametrized topological complexity of sphere bundles
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm [10] works under variable external conditions and generates continuous motions of the system to attain the prescribed sequence of states at prescribed moments of time. Topological complexity of such algorithms measures their structure and discontinuities. Information about states of the system consistent with states of the external conditions is described by a fibration $$p:E\rightarrow B$$ where the base B parametrizes the external conditions and each fibre $$p^{-1}(b)$$ is the configuration space of the system constrained by external conditions $$b\in B$$ ; more detail on this approach is given below. Our main goal in this paper is to study the sequential topological complexity of sphere bundles $$\dot{\xi }:\dot{E}\rightarrow B$$ ; in other words we study “parametrized families of spheres” and sequential parametrized motion planning algorithms for such bundles. We use the Euler and Stiefel–Whitney characteristic classes to obtain lower bounds on the topological complexity. We illustrate our results by many explicit examples. Some related results for the special case $$r=2$$ were described earlier in [13]. - Open Access
- 28 June 2024
- Published by Mathematical Sciences Publishers in Algebraic & Geometric Topology
- Vol. 24 (3) , 1755-1780
Sequential parametrized topological complexity and related invariants
Parametrized motion planning algorithms have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute part of the input of the algorithm. The concept of sequential parametrized topological complexity TC r OEp W E ! B is a measure of the complexity of such algorithms. It was studied by Cohen, Farber and Weinberger (2021, 2022) for r D 2 and by Farber and Paul (2022) for r 2. We analyze the dependence of the complexity TC r OEp W E ! B on an initial bundle with structure group G and on its fibre X viewed as a G-space. Our main results estimate TC r OEp W E ! B in terms of certain invariants of the bundle and the action on the fibre. Moreover, we also obtain estimates depending on the base and the fibre. Finally, we develop a calculus of sectional categories featuring a new invariant secat f OEp W E ! B which plays an important role in the study of sectional category of towers of fibrations.
- 28 June 2024
- Published by Mathematical Sciences Publishers in Algebraic & Geometric Topology
- Vol. 24 (3) , 1755-1780
Open AccessSequential parametrized topological complexity and related invariants
Parametrized motion planning algorithms have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute part of the input of the algorithm. The concept of sequential parametrized topological complexity TC r OEp W E ! B is a measure of the complexity of such algorithms. It was studied by Cohen, Farber and Weinberger (2021, 2022) for r D 2 and by Farber and Paul (2022) for r 2. We analyze the dependence of the complexity TC r OEp W E ! B on an initial bundle with structure group G and on its fibre X viewed as a G-space. Our main results estimate TC r OEp W E ! B in terms of certain invariants of the bundle and the action on the fibre. Moreover, we also obtain estimates depending on the base and the fibre. Finally, we develop a calculus of sectional categories featuring a new invariant secat f OEp W E ! B which plays an important role in the study of sectional category of towers of fibrations.
- Open Access
Sequential topological complexity of aspherical spaces and sectional categories of subgroup inclusions
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the level of fundamental groups. In doing so, we establish new lower bounds on sequential TCs of aspherical spaces as well as the parametrized TC of epimorphisms. Moreover, we generalize the Costa-Farber canonical class for TC to classes for sequential TCs and explore their properties. We combine them with the results on sequential TCs of aspherical spaces to obtain results on spaces that are not necessarily aspherical.
Open AccessSequential topological complexity of aspherical spaces and sectional categories of subgroup inclusions
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the level of fundamental groups. In doing so, we establish new lower bounds on sequential TCs of aspherical spaces as well as the parametrized TC of epimorphisms. Moreover, we generalize the Costa-Farber canonical class for TC to classes for sequential TCs and explore their properties. We combine them with the results on sequential TCs of aspherical spaces to obtain results on spaces that are not necessarily aspherical.
- Open Access
- 16 September 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (6) , 1551-1574
Large simplicial complexes: universality, randomness, and ampleness
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality (Even-Zohar et al. in Eur J Math 8(1):1–32, 2022; Farber and Mead in Topol Appl 272(22):107065, 2020; Farber et al. in J Appl Comput Topol 5(2):339–356, 2021). In the first part of the paper we concentrate on r-ample simplicial complexes which are high dimensional analogues of the r-e.c. graphs introduced originally by Erdős and Rényi (Acta Math Acad Sci Hungar 14:295–315, 1963), see also Bonato (Contrib Discrete Math 4(1):40–53, 2009). The class of r-ample complexes is useful for applications since these complexes allow extensions of subcomplexes of certain type in all possible ways; besides, r-ample complexes exhibit remarkable robustness properties. We discuss results about the existence of r-ample complexes and describe their probabilistic and deterministic constructions. The properties of random simplicial complexes in medial regime (Farber and Mead 2020) are important for this discussion since these complexes are ample, in certain range. We prove that the topological complexity of a random simplicial complex in the medial regime satisfies $$\textsf{TC}(X)\le 4$$ , with probability tending to 1 as $$n\rightarrow \infty $$ . There exists a unique (up to isomorphism) $$\infty $$ -ample complex on countable set of vertexes (the Rado complex), and the second part of the paper surveys the results about universality, homogeneity, indestructibility and other important properties of this complex. The Appendix written by J.A. Barmak discusses connectivity of conic and ample complexes.- 16 September 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (6) , 1551-1574
Open AccessLarge simplicial complexes: universality, randomness, and ampleness
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality (Even-Zohar et al. in Eur J Math 8(1):1–32, 2022; Farber and Mead in Topol Appl 272(22):107065, 2020; Farber et al. in J Appl Comput Topol 5(2):339–356, 2021). In the first part of the paper we concentrate on r-ample simplicial complexes which are high dimensional analogues of the r-e.c. graphs introduced originally by Erdős and Rényi (Acta Math Acad Sci Hungar 14:295–315, 1963), see also Bonato (Contrib Discrete Math 4(1):40–53, 2009). The class of r-ample complexes is useful for applications since these complexes allow extensions of subcomplexes of certain type in all possible ways; besides, r-ample complexes exhibit remarkable robustness properties. We discuss results about the existence of r-ample complexes and describe their probabilistic and deterministic constructions. The properties of random simplicial complexes in medial regime (Farber and Mead 2020) are important for this discussion since these complexes are ample, in certain range. We prove that the topological complexity of a random simplicial complex in the medial regime satisfies $$\textsf{TC}(X)\le 4$$ , with probability tending to 1 as $$n\rightarrow \infty $$ . There exists a unique (up to isomorphism) $$\infty $$ -ample complex on countable set of vertexes (the Rado complex), and the second part of the paper surveys the results about universality, homogeneity, indestructibility and other important properties of this complex. The Appendix written by J.A. Barmak discusses connectivity of conic and ample complexes. - 1 September 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 256 (1) , 213-231
The homology of random simplicial complexes in the multi-parameter upper model
- 1 September 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 256 (1) , 213-231
The homology of random simplicial complexes in the multi-parameter upper model