The dynamical properties of regularly recurrent point set

2021 ◽  
Author(s):  
Ji Zhan-jiang
Keyword(s):  
Recurrent Point ◽  
Point Set ◽  
Dynamical Properties

scholarly journals The Research of Sequence Shadowing Property and Regularly Recurrent Point on the Double Inverse Limit Space

2022 ◽  
Vol 2022 ◽  
pp. 1-6
Author(s):  
Zhan jiang Ji
Keyword(s):  
Inverse Limit ◽  
Point Sets ◽  
Recurrent Point ◽  
Shadowing Property ◽  
Limit Space ◽  
Shift Map ◽  
Dynamical Properties ◽  
Definition Of ◽  
Inverse Limit Space

According to the definition of sequence shadowing property and regularly recurrent point in the inverse limit space, we introduce the concept of sequence shadowing property and regularly recurrent point in the double inverse limit space and study their dynamical properties. The following results are obtained: (1) Regularly recurrent point sets of the double shift map σ f ∘ σ g are equal to the double inverse limit space of the double self-map f ∘ g in the regularly recurrent point sets. (2) The double self-map f ∘ g has sequence shadowing property if and only if the double shift map σ f ∘ σ g has sequence shadowing property. Thus, the conclusions of sequence shadowing property and regularly recurrent point are generalized to the double inverse limit space.

scholarly journals Recurrent point set of the shift on Σ and strong chaos

2002 ◽  
Vol 78 (2) ◽  
pp. 123-130 ◽  
Author(s):  
Lidong Wang ◽  
Gongfu Liao ◽  
Yu Yang
Keyword(s):  
Recurrent Point ◽  
Point Set

scholarly journals The G-sequence shadowing property and G-equicontinuity of the inverse limit spaces under group action

2021 ◽  
Vol 19 (1) ◽  
pp. 1290-1298
Author(s):  
Zhanjiang Ji
Keyword(s):  
Group Action ◽  
Inverse Limit ◽  
The Self ◽  
Recurrent Point ◽  
Shadowing Property ◽  
Inverse Limit Spaces ◽  
Limit Space ◽  
Dynamical Properties ◽  
Inverse Limit Space

Abstract First, we give the concepts of G-sequence shadowing property, G-equicontinuity and G-regularly recurrent point. Second, we study their dynamical properties in the inverse limit space under group action. The following results are obtained. (1) The self-mapping f f has the G-sequence shadowing property if and only if the shift mapping σ \sigma has the G ¯ \overline{G} -sequence shadowing property; (2) The self-mapping f f is G-equicontinuous if and only if the shift mapping σ \sigma is G ¯ \overline{G} -equicontinuous; (3) R R G ¯ ( σ ) = lim ← ( R R G ( f ) , f ) R{R}_{\overline{G}}\left(\sigma )=\underleftarrow{\mathrm{lim}}\left(R{R}_{G}(f),f) . These conclusions make up for the lack of theory in the inverse limit space under group action.

From the Oort cloud to Halley-type comets

1999 ◽  
Vol 173 ◽  
pp. 327-338 ◽  
Author(s):  
J.A. Fernández ◽  
T. Gallardo
Keyword(s):  
Total Population ◽  
Complex Function ◽  
Dynamical Evolution ◽  
Oort Cloud ◽  
Capture Process ◽  
Influx Rate ◽  
Short Period ◽  
Dynamical Properties ◽  
Orbital Periods ◽  
Probability Of Capture

AbstractThe Oort cloud probably is the source of Halley-type (HT) comets and perhaps of some Jupiter-family (JF) comets. The process of capture of Oort cloud comets into HT comets by planetary perturbations and its efficiency are very important problems in comet ary dynamics. A small fraction of comets coming from the Oort cloud − of about 10−2− are found to become HT comets (orbital periods < 200 yr). The steady-state population of HT comets is a complex function of the influx rate of new comets, the probability of capture and their physical lifetimes. From the discovery rate of active HT comets, their total population can be estimated to be of a few hundreds for perihelion distancesq <2 AU. Randomly-oriented LP comets captured into short-period orbits (orbital periods < 20 yr) show dynamical properties that do not match the observed properties of JF comets, in particular the distribution of their orbital inclinations, so Oort cloud comets can be ruled out as a suitable source for most JF comets. The scope of this presentation is to review the capture process of new comets into HT and short-period orbits, including the possibility that some of them may become sungrazers during their dynamical evolution.

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Dynamical properties of highly entangled polyalkylmethacrylate solutions : A comparative study

2000 ◽  
Vol 10 (PR7) ◽  
pp. Pr7-321-Pr7-324
Author(s):  
V. Villari ◽  
A. Faraone, ◽  
S. Magazù, ◽  
G. Maisano ◽  
R. Ponterio
Keyword(s):  
Comparative Study ◽  
Dynamical Properties

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

Pseudo-Anosov Theory

2017 ◽  
Author(s):  
Benson Farb ◽  
Dan Margalit
Keyword(s):  
Braid Groups ◽  
Intersection Numbers ◽  
Branched Covers ◽  
Algebraic Integers ◽  
Dehn Twists ◽  
Mapping Classes ◽  
Dynamical Properties

This chapter focuses on the construction as well as the algebraic and dynamical properties of pseudo-Anosov homeomorphisms. It first presents five different constructions of pseudo-Anosov mapping classes: branched covers, constructions via Dehn twists, homological criterion, Kra's construction, and a construction for braid groups. It then proves a few fundamental facts concerning stretch factors of pseudo-Anosov homeomorphisms, focusing on the theorem that pseudo-Anosov stretch factors are algebraic integers. It also considers the spectrum of pseudo-Anosov stretch factors, along with the special properties of those measured foliations that are the stable (or unstable) foliations of some pseudo-Anosov homeomorphism. Finally, it describes the orbits of a pseudo-Anosov homeomorphism as well as lengths of curves and intersection numbers under iteration.

Sign in / Sign up

Export Citation Format

Share Document