2016
DOI: 10.1063/1.4942799
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for concatenating templates

Abstract: We present two algorithms for concatenating two branched manifolds. There exist two common ways to describe representations of branched manifolds with linking matrices. The algorithms provided permit to concatenate branched manifolds with each representation: a linking matrix with an array or only one linking matrix. We also provide algorithms to switch between these two descriptions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
1
1
1

Relationship

3
0

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…It is a figure that represents the topological structure of a chaotic attractor. Since the 1990s there have been two different ways to represent templates with linking matrices that are still used today, as one can see in the recent paper of Gilmore and Rosalie [12], where algorithms are given to switch from one representation to the other. Hereinafter, the representation first given by Melvin and Tufillaro [17] is considered.…”
Section: Conventionmentioning
confidence: 99%
“…It is a figure that represents the topological structure of a chaotic attractor. Since the 1990s there have been two different ways to represent templates with linking matrices that are still used today, as one can see in the recent paper of Gilmore and Rosalie [12], where algorithms are given to switch from one representation to the other. Hereinafter, the representation first given by Melvin and Tufillaro [17] is considered.…”
Section: Conventionmentioning
confidence: 99%
“…A mixer M is defined by a linking matrix M where the right side is " " to represent the merging at the branch line with respect to the Tufillaro convention [8] (see [7] to distinguish the two linking matrix representation conventions). For the following section, we named linkers and mixers of template as actions and also consider torsions and permutations are linkers.…”
Section: Algebraic Relation Between Linking Matrixmentioning
confidence: 99%
“…Theorem 1 [7] Given a template T containing a mixer A of n a strips defined by the linking matrix A and a mixer B of n b strips defined by the linking matrix B. If A is concatenated before B, then A ⊕ B ≡ C, where C is a mixer of n a × n b strips defined by the linking matrix C that is the sum of the expanded linking matrices A and B with additional permutations due to the insertion of A…”
Section: Concatenation Of Mixersmentioning
confidence: 99%
See 1 more Smart Citation
“…conventions, see [19]. Here, the double line in the right bracket refers to the standard insertion convention indicating that the squeezing mechanism is included in the linking matrix.…”
Section: (Vi) Compute Numerically the Linking Numbers;mentioning
confidence: 99%