Related papers: Complexity of injective piecewise contracting inte…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x,y). If the source density f^+(x) is bounded…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
Symplectic maps are routinely used to describe single-particle dynamics in circular accelerators. In the case of a linear accelerator map, the rotation number (the betatron frequency) can be easily calculated from the map itself. In the…
An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…
We study the Manneville map f(x)=x+x^z (mod 1), with z>1, from a computational point of view, studying the behaviour of the Algorithmic Information Content. In particular, we consider a family of piecewise linear maps that gives examples of…
Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two…
In this article we show that a general notion of descent in coarse geometry can be applied to the study of injectivity of the $KH$-assembly map. We also show that the coarse assembly map is injective in general for finite coarse…
In exchange for large quantities of data and processing power, deep neural networks have yielded models that provide state of the art predication capabilities in many fields. However, a lack of strong guarantees on their behaviour have…
We consider piecewise $C^2$ non-flat maps of the interval and show that, for Lebesgue almost every point, its omega-limit set is either a periodic orbit, a cycle of intervals or the closure of the orbits of a subset of the critical points.…
In this paper, we show the results of the strength of attractorruins for a globally coupled map. The globally coupled map (GCM) is a discrete dynamical system, and here we consider a model in which the logistic map is globally coupled. An…
A standard theorem in nonsmooth analysis states that a piecewise affine function $F:\mathbb R^n\rightarrow\mathbb R^n$ is surjective if it is coherently oriented in that the linear parts of its selection functions all have the same nonzero…
Let $G$ be a group. A function $G\rightarrow G$ of the form $x\mapsto x^{\alpha}g$ for a fixed automorphism $\alpha$ of $G$ and a fixed $g\in G$ is called an affine map of $G$. In this paper, we study finite groups $G$ with an affine map of…
We introduce the concept of injective category number $\text{IC}(f)$ for a continuous map $f\colon X\to~Y$, and present fundamental results concerning this numerical invariant. The value $\text{IC}(f)$ quantifies the \aspas{complexity} or…
We study a certain class of piecewise monotonic maps of interval. These maps are strictly monotone on finite interval partition, satisfies Markov condition and have generator property. We show that for a function from this class…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We consider a class $\mathcal{F}$ of Markov multi-maps on the unit interval. Any multi-map gives rise to a space of trajectories, which is a closed, shift-invariant subset of $[0,1]^{\mathbb{Z}_+}$. For a multi-map in $\mathcal{F}$, we show…
Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of…