Open AccessOn Mathematical Braids
Author(s) -
Milagros Baldemor
Publication year - 2019
Publication title -
deleted journal
Language(s) - English
Resource type - Journals
ISSN - 2580-829X
DOI - 10.32734/jocai.v3.i1-624
Subject(s) - braid , braid theory , braid group , mathematics , set (abstract data type) , exponential function , sequence (biology) , connection (principal bundle) , pure mathematics , combinatorics , discrete mathematics , computer science , geometry , mathematical analysis , materials science , composite material , programming language , biology , genetics
A braid is any sequence of crossings of the -strand braid with a positive number n, provided none of the strands are self-crossing. The idea is that braids can be organized into groups, in which the group operation is *, which means: “do the first braid on a set of strands, and then follow it with a second on the twisted strand”. This study dealt with the formulation of additional basic properties of mathematical braids and the connection of mathematical braids to exponential theorems. Moreover, the researchers developed a program that could generate the total number of crossings and the total number of generators in an n-strand braid with a positive number n.