schubmult 1.3.0__tar.gz → 1.3.2__tar.gz

{schubmult-1.3.0 → schubmult-1.3.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: schubmult
-Version: 1.3.0
+Version: 1.3.2
 Summary: Computing Littlewood-Richardson coefficients of Schubert polynomials
 Home-page: https://github.com/matthematics/schubmult
 Author: Matt Samuel

{schubmult-1.3.0 → schubmult-1.3.2}/schubmult/perm_lib.py

@@ -98,10 +98,10 @@ def count_bruhat(perm,i,j):
 	else:
 		up_amount = -1
 	for k in range(i+1,j):
-		if perm[i]<perm[k] and perm[j]>perm[k]:
-			up_amount+=1
-		elif perm[i]>perm[k] and perm[j]<perm[k]:
-			up_amount-=1
+		if perm[i]<perm[k] and perm[k]<perm[j]:
+			up_amount+=2
+		elif perm[i]>perm[k] and perm[k]>perm[j]:
+			up_amount-=2
 	return up_amount
 
 
@@ -145,24 +145,27 @@ def elem_sym_perms_q(orig_perm,p,k):
 	up_perm_list = [(orig_perm,1,1000)]
 	for pp in range(p):
 		perm_list = []
-		for up_perm, last, last_j in up_perm_list:	
+		for up_perm, val, last_j in up_perm_list:	
 			up_perm2 = [*up_perm,len(up_perm)+1]
 			if len(up_perm2) < k + 1:
 				up_perm2 += [i+1 for i in range(len(up_perm2),k+2)]
-			pos_list = [i for i in range(k) if i>=len(orig_perm) or up_perm2[i] == orig_perm[i]]
-			for j in range(min(last_j,len(up_perm2)-1),k-1,-1):
+			pos_list = [i for i in range(k) if (i>=len(orig_perm) and up_perm2[i]==i+1) or (i<len(orig_perm) and up_perm2[i] == orig_perm[i])]
+			for j in range(min(len(up_perm2)-1,last_j),k-1,-1):
 				for i in pos_list:
 					ct = count_bruhat(up_perm2,i,j)
+					#print(f"{up_perm2=} {ct=} {i=} {j=} {k=} {pp=}")
 					if ct == 1 or ct == 2*(i-j)+1:
 						new_perm = [*up_perm2]
 						new_perm[i],new_perm[j] = new_perm[j],new_perm[i]
 						new_perm_add = tuple(permtrim(new_perm))
-						new_last = last
+						new_val = val
 						if ct<0:
-							new_last *= np.prod([q_var[index] for index in range(i+1,j+1)])
-						perm_list += [(new_perm_add,new_last,j)]
-						total_list+=[(new_perm_add,pp+1,new_last)]
+							new_val *= np.prod([q_var[index] for index in range(i+1,j+1)])
+						#print(f"{ct=} {i=} {j=} {k=} {last_j=} {pp=} {up_perm2=} {new_perm_add=} {new_val=}")
+						perm_list += [(new_perm_add,new_val,j)]
+						total_list+=[(new_perm_add,pp+1,new_val)]
 		up_perm_list = perm_list
+	#print(f"{total_list=}")
 	return total_list
 
 

{schubmult-1.3.0 → schubmult-1.3.2}/schubmult/schubmult_q/schubmult_q.py

@@ -6,9 +6,10 @@ import sys
 
 def schubmult(perm_dict,v):
 	vn1 = inverse(v)
-	th = [len(v)-i for i in range(1,len(v))]	
+	th = [len(v)-i for i in range(1,len(v)+1)]	
 	mu = permtrim(uncode(th))
 	vmu = permtrim(mulperm([*v],mu))
+	#print(f"{th=} {mu=} {vmu=}")
 	inv_vmu = inv(vmu)
 	inv_mu = inv(mu)
 	ret_dict = {}
@@ -29,17 +30,16 @@ def schubmult(perm_dict,v):
 			newpathsums = {}
 			for up in vpathsums:
 				newperms = elem_sym_perms_q(up,mx_th,th[index])
-				for vp in vpathsums[up]:
-					sumval = vpathsums[up][vp]
-					if sumval == 0:
-						continue
-					for v2,vdiff,s in vpathdicts[index][vp]:
-						addsumval = s*sumval
-						for up2, udiff, mul_val in newperms:					
-							if vdiff + udiff == th[index]:								
-								if up2 not in newpathsums:
-									newpathsums[up2]={}
-								newpathsums[up2][v2] = newpathsums[up2].get(v2,0)+mul_val*addsumval
+				for up2, udiff, mul_val in newperms:
+					if up2 not in newpathsums:
+						newpathsums[up2]={}
+					for v in vpathdicts[index]:
+						sumval = vpathsums[up].get(v,zero)
+						if sumval == 0:
+							continue
+						for v2,vdiff,s in vpathdicts[index][v]:
+							if udiff+vdiff==th[index]:
+								newpathsums[up2][v2] = newpathsums[up2].get(v2,zero)+s*sumval*mul_val
 			vpathsums = newpathsums
 		toget = tuple(vmu)
 		ret_dict = add_perm_dict({ep: vpathsums[ep].get(toget,0) for ep in vpathsums},ret_dict)

{schubmult-1.3.0 → schubmult-1.3.2}/schubmult.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: schubmult
-Version: 1.3.0
+Version: 1.3.2
 Summary: Computing Littlewood-Richardson coefficients of Schubert polynomials
 Home-page: https://github.com/matthematics/schubmult
 Author: Matt Samuel

{schubmult-1.3.0 → schubmult-1.3.2}/setup.py

@@ -6,7 +6,7 @@ long_description = (this_directory / "README.md").read_text()
 
 setup(
     name="schubmult",
-    version="1.3.0",
+    version="1.3.2",
     description="Computing Littlewood-Richardson coefficients of Schubert polynomials",
 	long_description=long_description,
 	long_description_content_type='text/markdown',