Related papers: Complexity of injective piecewise contracting inte…

An adaptive isogeometric method based on $d$-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop [6]. In…

MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation…

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

This paper discusses possible approaches to the escape rate in infinite lattices of weakly coupled maps with uniformly expanding repeller. It is proved that computed-via-volume rates of spatially periodic approximations grow linearly with…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

We study countably piecewise continuous, piecewise monotone interval maps. We establish a necessary and sufficient criterion for the existence of a nondecreasing semiconjugacy to a map of constant slope in terms of the existence of an…

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

We define linear and radial stretch maps in the affine-additive group, and prove that they are minimizers of the mean quasiconformal distortion functional. For the proofs we use a method based on the notion of modulus of a curve family and…

We consider a complete metric space $(X,d)$ and a countable number of contractive mappings on $X$, $\mathcal{F}=\{F_i:i\in\mathbb N\}$. We show the existence of a {\em smallest} invariant set (with respect to inclusion) for $\mathcal{F}$.…

We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

We give a further development of the Aichinger-Moosbauer calculus of functional degrees of maps between commutative groups. For any fixed given commutative groups $A$ and $B$, we compute the largest possible finite functional degree that a…

We study continuous countably piecewise monotone interval maps, and formulate conditions under which these are conjugate to maps of constant slope, particularly when this slope is given by the topological entropy of the map. We confine our…

Some fixed point results are given for a class of functional contractions over partial metric spaces. These extend some contributions in the area due to Ilic et al [Math. Comput. Modelling, 55 (2012), 801-809].

Many separable nonlinear optimization problems can be approximated by their nonlinear objective functions with piecewise linear functions. A natural question arising from applying this approach is how to break the interval of interest into…

We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

A unitarily invariant projective framework is introduced to analyze the complexity of path-following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill-posedness, is given. A Newton map…

For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…