Related papers: Monotone-light factorizations in coarse geometry

We prove a basic property of continuous multilinear mappings between topological vector spaces, from which we derive an easy proof of the fact that a multilinear mapping (and a polynomial) between topological vector spaces is weakly…

We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…

We introduce the notion of (hybrid) large scale normal space and prove coarse geometric analogues of Urysohn's Lemma and the Tietze Extension Theorem for these spaces, where continuous maps are replaced by (continuous and) slowly…

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a…

In this paper we collect some open set-theoretic problems that appear in the large-scale topology (called also Asymptology). In particular we ask problems about critical cardinalities of some special (large, indiscrete, inseparated) coarse…

The state spaces of machines admit the structure of time. A homotopy theory respecting this additional structure can detect machine behavior unseen by classical homotopy theory. In an attempt to bootstrap classical tools into the world of…

We define monotone links on a torus, obtained as projections of curves in the plane whose coordinates are monotone increasing. Using the work of Morton-Samuelson, to each monotone link we associate elements in the double affine Hecke…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem). We have developed an efficient algorithm for light spanners in bounded pathwidth graphs, based…

We give an account of lax orthogonal factorisation systems on order-enriched categories. Among them, we define and characterise the KZ-reflective ones, in a way that mirrors the characterisation of reflective orthogonal factorisation…

A monotone self-mapping of the nonnegative orthant induces a monotone discrete-time dynamical system which evolves on the same orthant. If with respect to this system the origin is attractive then there must exists points whose image under…

In this note we give a simple argument for the fact that the coarse assembly map for a strong coarse homology theory with weak transfers and a bornological coarse space of weakly finite homotopical asymptotic dimension is a phantom…

We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…

Spatial chaos as a phenomenon of ultimate complexity requires the efficient numerical algorithms. For this purpose iterative low-dimensional maps have demonstrated high efficiency. Natural generalization of Feigenbaum and Ikeda maps may…

We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.

Using the language of coarse homology theories, we provide an axiomatic account of vanishing results for the fibres of forget-control maps associated to spaces with equivariant finite decomposition complexity.

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

This paper centers around two basic problems of topological coincidence theory. First, try to measure (with help of Nielsen and minimum numbers) how far a given pair of maps is from being loose, i.e. from being homotopic to a pair of…

We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…

Inspired by group cohomology, we define several coarse topological invariants of metric spaces. We define the coarse cohomological dimension of a metric space, and demonstrate that if G is a countable group, then the coarse cohomological…