Skip to content

Instantly share code, notes, and snippets.

View amitjamadagni's full-sized avatar

Amit amitjamadagni

29 followers · 15 following
View GitHub Profile
@amitjamadagni
amitjamadagni / A better than the initial version
Created May 24, 2014 22:45
Seifert Matrx
r"""
Link class
"""
#*****************************************************************************
# Copyright (C) 2014
#
# Distributed under the terms of the GNU General Public License (GPL)
# http://www.gnu.org/licenses/
#*****************************************************************************
@amitjamadagni
amitjamadagni / The logic for the braidwordcomponent has been reworked
Created May 25, 2014 17:11
Reworked logic
r"""
Link class
"""
#*****************************************************************************
# Copyright (C) 2014
#
# Distributed under the terms of the GNU General Public License (GPL)
# http://www.gnu.org/licenses/
#*****************************************************************************
@amitjamadagni
amitjamadagni / code snippet for conversion from dt to gauss
Created May 30, 2014 09:57
DT code to gauss
dt = self._dt_code
gauss = []
y = [None for i in range(2*len(dt))]
x = [0 for i in range(2*len(dt))]
for i in range(len(dt)):
x[2*i] = 2*i + 1
x[2*i + 1] = dt[i]
for i in range(len(dt)):
if x[2*i+1] > 0:
y[2*i+1] = 'under'
@amitjamadagni
amitjamadagni / Method of gauss which returns gauss for any input
Created June 1, 2014 18:42
DT to Gauss
def gauss_code(self):
r"""
Returns the gauss_code
INPUT:
- Either a braidword, gauss_code, dt_code
OUTPUT:
- Gauss code representation of the INPUT
@amitjamadagni
amitjamadagni / The conversion from braid to DT
Created June 1, 2014 19:07
Braid to DT
def dt_code(self):
r"""
Returns the dt_code
INPUT:
- Either a braidword, gauss_code, dt_code
OUTPUT:
- DT Code representation of the INPUT
@amitjamadagni
amitjamadagni / braidword to PD Code
Created June 9, 2014 01:28
PD Code method
def PD_code(self):
'''dt = self.dt_code()
y = [None for i in range(2*len(dt))]
x = [0 for i in range(2*len(dt))]
for i in range(len(dt)):
x[2*i] = 2*i + 1
x[2*i + 1] = dt[i]
#print x
p = [[None,None] for i in range(len(x))]
t = [abs(r) for r in x]
@amitjamadagni
amitjamadagni / gist:541607132814f3e04471
Created June 20, 2014 15:38
l1 = list(left_component)
print l1
for i in l1:
if i[0] < 0:
i[0] = abs(i[0])
elif i[1] < 0:
i[1] = abs(i[1])
print l1
print id(l1)
print left_component
@amitjamadagni
amitjamadagni / gist:f12f39a9246651854d74
Created June 20, 2014 15:58
r"""
Link class
"""
#*****************************************************************************
# Copyright (C) 2014
#
# Distributed under the terms of the GNU General Public License (GPL)
# http://www.gnu.org/licenses/
#*****************************************************************************
@amitjamadagni
amitjamadagni / scandregions
Created June 21, 2014 21:17
Seifert circles and the regions of the knot
def seifert_circles(self, oriented_gauss_code):
self.oriented_gauss_code = oriented_gauss_code
x = self.PD_code_ogc(self.oriented_gauss_code)
s = [[None for i in range(4)] for i in range(len(x))]
for i in range(len(x)):
s[i][0] = 'entering'
s[i][2] = 'leaving'
if self.oriented_gauss_code[1][i] == '-':
s[i][1] = 'leaving'
s[i][3] = 'entering'
@amitjamadagni
amitjamadagni / vogel
Created June 23, 2014 16:02
Vogel implementation along with PD Code
#whatever is the crossing one should give the sign for that first
#the order of the sign is as per the ordering of the crossings as in the gauss code
#so for example if the gauss code is 1 -3 2 -1 3 -2 then the order of the sign of the crossings is
#sign of crossing 1 then 3 then at 2 and so on and so forth.
def PD_code_ogc(self, oriented_gauss_code):
self.oriented_gauss_code = oriented_gauss_code
gc = self.oriented_gauss_code[0]
gc_sign = self.oriented_gauss_code[1]
l = [0 for i in range(len(gc))]
for i in range(len(gc)):