Systems of 3-braid equations (Q485089): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hugo Cabrera-Ibarra / rank
Normal rank
 
Property / author
 
Property / author: David A. Lizárraga-Navarro / rank
Normal rank
 
Property / author
 
Property / author: Hugo Cabrera-Ibarra / rank
 
Normal rank
Property / author
 
Property / author: David A. Lizárraga-Navarro / rank
 
Normal rank
Property / review text
 
The tangle model introduced by \textit{C. Ernst} and \textit{D. W. Sumners} [Math. Proc. Camb. Philos. Soc. 108, No. 3, 489--515 (1990; Zbl 0727.57005)] is a useful topological tool in the study of the mechanism of action of certain enzymes on DNA molecules. Roughly speaking, the tangle model consists of a system of equations in which the unknowns on the left-hand side of each equation are tangles, whereas the data on the right-hand sides are known knots and links (often 2-bridge knots or 4-plats). Solving the tangle model means to determine the topological type of the unknown tangles. In this paper, the authors consider a tangle model where the unknown tangles are 3-braids. The authors define a closure operation denoted by \(A\) that converts a 3-braid into a 4-plat by adding a fourth string to the braid that does not interact with the other three strings. The authors now consider equations of the form \(A(S+n T)=b(\alpha_n, \beta_n)\), where \(S,T\) are 3-braids, and \(b(\alpha_n, \beta_n)\) are 4-plats. \(n=\{1,2\}, \{1,2,3\}\) or \(\{1,2,3,4\}\) results in systems of 2, 3 or 4 equations. The authors show that, while a system of two equations always admits a solution for any selection of 2-bridge knots, adding a third equation reduces the number of possible knots to only 6, 9 or 18, the exact value depending on the relationships satisfied by the knots in the first two equations. If a fourth equation is adjoined, however, exactly one 2-bridge knot may appear in its the right-hand side for the system to admit a solution. Furthermore, a new simple method that exploits an unexpected cyclic behavior of the solutions is presented and used to construct the proofs. The method relies on the continued fractions associated with 2-bridge knots and their behavior under the concatenation of 3-braids. The work here extends earlier work by some of the authors [\textit{H. Cabrera-Ibarra} and \textit{D. A. Lizárraga-Navarro}, J. Knot Theory Ramifications 19, No. 8, 1051--1074 (2010; Zbl 1205.57009)].
Property / review text: The tangle model introduced by \textit{C. Ernst} and \textit{D. W. Sumners} [Math. Proc. Camb. Philos. Soc. 108, No. 3, 489--515 (1990; Zbl 0727.57005)] is a useful topological tool in the study of the mechanism of action of certain enzymes on DNA molecules. Roughly speaking, the tangle model consists of a system of equations in which the unknowns on the left-hand side of each equation are tangles, whereas the data on the right-hand sides are known knots and links (often 2-bridge knots or 4-plats). Solving the tangle model means to determine the topological type of the unknown tangles. In this paper, the authors consider a tangle model where the unknown tangles are 3-braids. The authors define a closure operation denoted by \(A\) that converts a 3-braid into a 4-plat by adding a fourth string to the braid that does not interact with the other three strings. The authors now consider equations of the form \(A(S+n T)=b(\alpha_n, \beta_n)\), where \(S,T\) are 3-braids, and \(b(\alpha_n, \beta_n)\) are 4-plats. \(n=\{1,2\}, \{1,2,3\}\) or \(\{1,2,3,4\}\) results in systems of 2, 3 or 4 equations. The authors show that, while a system of two equations always admits a solution for any selection of 2-bridge knots, adding a third equation reduces the number of possible knots to only 6, 9 or 18, the exact value depending on the relationships satisfied by the knots in the first two equations. If a fourth equation is adjoined, however, exactly one 2-bridge knot may appear in its the right-hand side for the system to admit a solution. Furthermore, a new simple method that exploits an unexpected cyclic behavior of the solutions is presented and used to construct the proofs. The method relies on the continued fractions associated with 2-bridge knots and their behavior under the concatenation of 3-braids. The work here extends earlier work by some of the authors [\textit{H. Cabrera-Ibarra} and \textit{D. A. Lizárraga-Navarro}, J. Knot Theory Ramifications 19, No. 8, 1051--1074 (2010; Zbl 1205.57009)]. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Claus Ernst / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 57M25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 57M27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20F36 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6384875 / rank
 
Normal rank
Property / zbMATH Keywords
 
tangle model
Property / zbMATH Keywords: tangle model / rank
 
Normal rank
Property / zbMATH Keywords
 
3-string tangles
Property / zbMATH Keywords: 3-string tangles / rank
 
Normal rank
Property / zbMATH Keywords
 
3-braids
Property / zbMATH Keywords: 3-braids / rank
 
Normal rank
Property / zbMATH Keywords
 
4-plats
Property / zbMATH Keywords: 4-plats / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40590-014-0031-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998717665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangle solutions for a family of DNA-rearranging proteins / rank
 
Normal rank
Property / cites work
 
Property / cites work: BRAID SOLUTIONS TO THE ACTION OF THE GIN ENZYME / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLASSIFICATION OF RATIONAL 3-TANGLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangle analysis of difference topology experiments: applications to a Mu protein-DNA complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for rational tangles: applications to DNA recombination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knoten mit zwei Brücken / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangle analysis of Gin site-specific recombination / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Systems of 3-braid equations
scientific article

    Statements

    Systems of 3-braid equations (English)
    0 references
    9 January 2015
    0 references
    The tangle model introduced by \textit{C. Ernst} and \textit{D. W. Sumners} [Math. Proc. Camb. Philos. Soc. 108, No. 3, 489--515 (1990; Zbl 0727.57005)] is a useful topological tool in the study of the mechanism of action of certain enzymes on DNA molecules. Roughly speaking, the tangle model consists of a system of equations in which the unknowns on the left-hand side of each equation are tangles, whereas the data on the right-hand sides are known knots and links (often 2-bridge knots or 4-plats). Solving the tangle model means to determine the topological type of the unknown tangles. In this paper, the authors consider a tangle model where the unknown tangles are 3-braids. The authors define a closure operation denoted by \(A\) that converts a 3-braid into a 4-plat by adding a fourth string to the braid that does not interact with the other three strings. The authors now consider equations of the form \(A(S+n T)=b(\alpha_n, \beta_n)\), where \(S,T\) are 3-braids, and \(b(\alpha_n, \beta_n)\) are 4-plats. \(n=\{1,2\}, \{1,2,3\}\) or \(\{1,2,3,4\}\) results in systems of 2, 3 or 4 equations. The authors show that, while a system of two equations always admits a solution for any selection of 2-bridge knots, adding a third equation reduces the number of possible knots to only 6, 9 or 18, the exact value depending on the relationships satisfied by the knots in the first two equations. If a fourth equation is adjoined, however, exactly one 2-bridge knot may appear in its the right-hand side for the system to admit a solution. Furthermore, a new simple method that exploits an unexpected cyclic behavior of the solutions is presented and used to construct the proofs. The method relies on the continued fractions associated with 2-bridge knots and their behavior under the concatenation of 3-braids. The work here extends earlier work by some of the authors [\textit{H. Cabrera-Ibarra} and \textit{D. A. Lizárraga-Navarro}, J. Knot Theory Ramifications 19, No. 8, 1051--1074 (2010; Zbl 1205.57009)].
    0 references
    0 references
    tangle model
    0 references
    3-string tangles
    0 references
    3-braids
    0 references
    4-plats
    0 references

    Identifiers