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 / seifert matrix
Created March 7, 2014 21:33
A very initial implementation of Seifert Matrix.
from sage.matrix.constructor import identity_matrix, matrix
def components(x):
new = []
for i in range(len(x)):
a = abs(x[i])
new.append(a)
print new
sorted = list(set(new))
print sorted
'''sorting the absolute values of the braid word'''
@amitjamadagni
amitjamadagni / Methods implemented as of now
Last active August 29, 2015 14:01
Seifert Matrix
from sage.groups.free_group import FreeGroupElement
from sage.groups.braid import Braid
#from sage.matrix.matrix_integer_dense import Matrix_integer_dense, delete_rows
class Link:
def __init__(self, input = None, gauss_code = None, dt_code = None):
if type(input) == sage.groups.braid.Braid:
self._braid = input
self._gauss_code = None
self._dt_code = None
@amitjamadagni
amitjamadagni / Major work without documentation
Created May 22, 2014 12:18
Seifert matrix
from sage.groups.free_group import FreeGroupElement
from sage.groups.braid import Braid
class Link:
def __init__(self, input = None, gauss_code = None, dt_code = None):
if type(input) == sage.groups.braid.Braid:
self._braid = input
self._gauss_code = None
self._dt_code = None
@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