def __init__ (self, d2):
self.matrix = CIMatrix(4,2*d2)
self.dim2 = d2
class BinomialPattern222k(object):
"Store and work with Binomial Patterns in CI analysis"
# Defining the data :
def __init__ (self, d2):
self.matrix = CIMatrix(4,2*d2)
self.dim2 = d2
def __getIndex__ (self, s):
"""Turns a string like 2222 into an a row col index, correcting the off by one
Input: s the string, kk the format invariant
1 and 2 index the rows, 1 the big jump
3 and 4 index the cols, 3 the big jump
Format:
1111 1112 1121 1122
1211 1212 1221 1222
2111 2112 2121 2122
2211 2212 2221 2222
"""
i = int(s[0])
j = int(s[1])
k = int(s[2])
l = int(s[3])
m = 2*(i-1) + (j-1) # Rowindex
n = self.dim2*(k-1) + (l-1)# Colindex
return (m,n)
## Comparison Operators ##
def __eq__(self, other):
for i in range(4):
for j in range(2*self.dim2):
if not self.matrix.getval(i,j) == other.matrix.getval(i,j):
return False
return True;
def __ne__(self, other):
if self == other: return False
else: return True
def printRaw (self): self.matrix.printRawList()
def printAsMatrix (self): self.matrix.printMatrix()
def setFromBinomial (self, s):
"Init from Binomial string in 1,2,... notation"
## Init zero
self.matrix.clear()
## Find and remove divisors of the two binomials
t = s.split("-")
g = [m.split("*") for m in t]
divisors = removeDup(g[0],g[1])
for d in divisors:
(m,n) = self.__getIndex__ (d)
self.matrix.setval(m,n,CIMatrixEntry("*"))
for l in g[0]:
# for each positive term
(m,n) = self.__getIndex__ (l)
self.matrix.setval(m,n,CIMatrixEntry("1"))
for l in g[1]:
(m,n) = self.__getIndex__ (l)
self.matrix.setval(m,n,CIMatrixEntry("-1"))
def setFromPattern (self, p):
for i in range(4):
for j in range(2*self.dim2):
self.matrix.setval(i,j, p.matrix.getval(i,j))
def invert (self):
"Inverts the saved pattern"
for i in range(4):
for j in range(2*self.dim2):
self.matrix.setval(i,j, -self.matrix.getval(i,j))
def fixTermOrder (self):
"Fixes the pattern such that the last entry is a -"
l = flatten(self.matrix.getRawList())
l.reverse()
signs = []
for ll in l:
if ll.star :
signs.append(0)
else :
i = int(ll.s)
if i == 0 : signs.append(0)
else :
if i > 0 : signs.append(1)
else : signs.append(-1)
try:
if signs.index(1) < signs.index(-1):
self.invert()
except ValueError:
pass
def getString (self):
"""return string representing the pattern.
Warning: * will not have powers !
"""
pass
def Spair (self, p2):
spair = BinomialPattern222k(self.dim2)
"Forms an S-pair of the current pattern and p2"
for i in range(4):
for j in range(2*self.dim2):
spair.matrix.setval(i,j, self.matrix.getval(i,j) + p2.matrix.getval(i,j))
return spair
def redu(self, p2):
"reduces self with respect to p2 if possible, otherwise return -1 if no reduction is possible, 0 otherwise"
# Ok, reduction is possible
redu = copyPattern222k(self)
try:
for i in range(4):
for j in range(2*self.dim2):
redu.matrix.setval(i,j, redu.matrix.getval(i,j) - p2.matrix.getval(i,j) )
except NotReducibleError:
return -1
# Ok, was reducible
self.setFromPattern(redu)
return 0
