Displaying 501 – 520 of 867

Showing per page

Complexity of the class of Peano functions

K. Omiljanowski, S. Solecki, J. Zielinski (2000)

Colloquium Mathematicae

We evaluate the descriptive set theoretic complexity of the space of continuous surjections from m to n .

Composant-like decompositions

Wojciech Dębski, E. Tymchatyn (1991)

Fundamenta Mathematicae

The body of this paper falls into two independent sections. The first deals with the existence of cross-sections in F σ -decompositions. The second deals with the extensions of the results on accessibility in the plane.

Composants of the horseshoe

Christoph Bandt (1994)

Fundamenta Mathematicae

The horseshoe or bucket handle continuum, defined as the inverse limit of the tent map, is one of the standard examples in continua theory as well as in dynamical systems. It is not arcwise connected. Its arcwise components coincide with composants, and with unstable manifolds in the dynamical setting. Knaster asked whether these composants are all homeomorphic, with the obvious exception of the zero composant. Partial results were obtained by Bellamy (1979), Dębski and Tymchatyn (1987), and Aarts...

Compositions of simple maps

Jerzy Krzempek (1999)

Fundamenta Mathematicae

A map (= continuous function) is of order ≤ k if each of its point-inverses has at most k elements. Following [4], maps of order ≤ 2 are called simple.  Which maps are compositions of simple closed [open, clopen] maps? How many simple maps are really needed to represent a given map? It is proved herein that every closed map of order ≤ k defined on an n-dimensional metric space is a composition of (n+1)k-1 simple closed maps (with metric domains). This theorem fails to be true...

Computing complexity distances between algorithms

Salvador Romaguera, Enrique A. Sánchez-Pérez, Oscar Valero (2003)

Kybernetika

We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which is suitable to give a quantitative measure of the improvement in complexity obtained when a complexity function is replaced by a more efficient complexity function on all inputs, and show that this distance function has the advantage of possessing rich topological and quasi-metric properties. In particular, its induced topology is Hausdorff and completely regular. Our approach is applied to the measurement...

Computing explicitly topological sequence entropy: the unimodal case

Victor Jiménez López, Jose Salvador Cánovas Peña (2002)

Annales de l’institut Fourier

Let W ( I ) denote the family of continuous maps f from an interval I = [ a , b ] into itself such that (1) f ( a ) = f ( b ) { a , b } ; (2) they consist of two monotone pieces; and (3) they have periodic points of periods exactly all powers of 2 . The main aim of this paper is to compute explicitly the topological sequence entropy h D ( f ) of any map f W ( I ) respect to the sequence D = ( 2 m - 1 ) m = 1 .

Computing homology.

Kaczynski, Tomasz, Mischaikow, Konstantin, Mrozek, Marian (2003)

Homology, Homotopy and Applications

Concave iteration semigroups of linear set-valued functions

Jolanta Olko (1999)

Annales Polonici Mathematici

We consider a concave iteration semigroup of linear continuous set-valued functions defined on a closed convex cone in a separable Banach space. We prove that such an iteration semigroup has a selection which is also an iteration semigroup of linear continuous functions. Moreover it is majorized by an "exponential" family of linear continuous set-valued functions.

Currently displaying 501 – 520 of 867