نتایج جستجو برای: homeomorphism

تعداد نتایج: 4353  

1956
Stanley S. Chang Shmuel Weinberger

We say that an arbitrary manifold (M,∂M) is topologically rigid relative to its ends if it satisfies the following condition. If (N, ∂N) is any other manifold with a compact subset C ⊂ N for which a proper homotopy equivalence h : (N, ∂N)→ (M,∂M) is a homeomorphism on ∂N ∪ (N\C), then there is a compact subset K ⊂ N and a proper homotopy ht : (N, ∂N) → (M,∂M) from h to a homeomorphism such that...

Journal: :Journal of Theoretical Probability 2022

This paper is devoted to characterizing so-called order isomorphisms intertwining the $$L^2$$ -semigroups of two quasi-regular Dirichlet forms. We first show that every unitary isomorphism semigroups composition h-transformation and quasi-homeomorphism. In addition, under assumption underlying spaces admit irreducible decompositions for forms, (not necessarily unitary) can be expressed as h-tra...

2010
N. E. FOLAND

2. A topological classification of the almost periodic homeomorphisms on a closed 2-cell. A homeomorphism A of a metric space (X, p) onto itself is said to be almost periodic on X if €>0 implies that there exists a relatively dense sequence {«¿} of integers such that p(x, A"*'(x)) <e for all xGA and i= ±1, ±2, • • •. A homeomorphism A of the space X onto itself is said to be topologically equiv...

Journal: :J. Graph Algorithms Appl. 2012
John M. Boyer

This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3. These extensions derive much of their behavior and correctness from the edge addition planarity algorithm, providing an alternative perspective on these subgraph homeomorphism problems based on affinity with planarity rather t...

2008
DAN MARGALIT

We study those Artin groups which, modulo their centers, are finite index subgroups of the mapping class group of a punctured sphere. In particular, we show that any injective homomorphism between these groups is parameterized by a homeomorphism of a punctured disk together with a homomorphism to the integers. The technique, following Ivanov, is to prove that every superinjective map of the com...

Journal: :Discrete Mathematics 2009
Dominique Barth Hervé Fournier Romain Ravaux

A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. The aim of the paper is to study the homeomorphism classes of decomposable trees. More precisely, we show that homeomorphism classes containing decomposable trees with an arbitrarily large minimal dist...

2011
RAFAEL POTRIE R. POTRIE

We prove that a homeomorphism of the torus homotopic to the identity whose rotation set is reduced to a single totally irrational vector is chain-recurrent. In fact, we show that pseudo-orbits can be chosen with a small number of jumps, in particular, that the nonwandering set is weakly transitive. We give an example showing that the nonwandering set of such a homeomorphism may not be transitive.

2004
SU GAO

We consider the homeomorphism problem for countable topological spaces and investigate its descriptive complexity as an equivalence relation. It is shown that even for countable metric spaces the homeomorphism problem is strictly more complicated than the isomorphism problem for countable graphs and indeed it is not Borel reducible to any orbit equivalence relation induced by a Borel action of ...

Journal: :Inf. Syst. 2009
Michaela Götz Christoph Koch Wim Martens

Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorph...

2007
Michaela Götz Christoph Koch Wim Martens

Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorph...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید