schubmult 1.4.1__tar.gz → 1.4.2__tar.gz

{schubmult-1.4.1 → schubmult-1.4.2}/PKG-INFO

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

{schubmult-1.4.1 → schubmult-1.4.2}/schubmult/perm_lib.py

@@ -307,6 +307,22 @@ def reduce_q_coeff(u, v, w, qv):
 			if i>=len(w)-1 or w[i]<w[i+1]:
 				qv_ret[i] -= 1
 			return tuple(permtrim(ret_u)), v, tuple(permtrim(ret_w)), qv_ret, True
+		elif i<len(u)-1 and u[i]>u[i+1] and (i>=len(v)-1 or v[i]<v[i+1]) and sg(i,w)==1 and omega(i+1,qv) == 0:
+			ret_u = [*u]
+			ret_u[i], ret_u[i+1] = ret_u[i+1], ret_u[i]
+			ret_w = [*w] + [j+1 for j in range(len(w),i+2)]
+			ret_w[i], ret_w[i+1] = ret_w[i+1], ret_w[i]
+			qv_ret = [*qv]
+			#print("Blop u")
+			return tuple(permtrim(ret_u)), v, tuple(permtrim(ret_w)), qv_ret, True
+		elif i<len(v)-1 and v[i]>v[i+1] and (i>=len(u)-1 or u[i]<u[i+1]) and sg(i,w) == 1 and omega(i+1,qv) == 0:
+			ret_v = [*v]
+			ret_v[i], ret_v[i+1] = ret_v[i+1], ret_v[i]
+			ret_w = [*w] + [j+1 for j in range(len(w),i+2)]
+			ret_w[i], ret_w[i+1] = ret_w[i+1], ret_w[i]
+			qv_ret = qv
+			#print("Blop v")
+			return u, tuple(permtrim(ret_v)), tuple(permtrim(ret_w)), qv_ret, True
 	return u, v, w, qv, False
 		
 # perms and inversion diff

{schubmult-1.4.1 → schubmult-1.4.2}/schubmult/schubmult_q_yz/schubmult_q_yz.py

@@ -524,7 +524,7 @@ def main():
 												q_part2 = np.prod([q_var[i+1]**qv[i] for i in range(len(qv))])
 												if q_part2 == 1:												
 													#if q_part != q_part2:
-													#	print("Posified q part")
+													#	print(f"Posified q part {q_part} {q_dict[q_part]=}")
 													val2 += q_part*posify(q_dict[q_part],u2,v2,w2,var2_t,var3_t,msg,False)
 												else:
 													val2 += q_part*compute_positive_rep(q_dict[q_part],var2_t,var3_t,msg,False)

{schubmult-1.4.1 → schubmult-1.4.2}/schubmult/schubmult_yz/schubmult_yz.py

@@ -1315,55 +1315,55 @@ def posify(val,u2,v2,w2,var2=var2,var3=var3,msg=False,do_pos_neg=True,sign_only=
 				val2 = schubmult_one(tuple(permtrim(u3)),tuple(permtrim(v3)),var2,var3).get(tuple(permtrim(w3)),0)
 				val2 = posify(val2,u3,tuple(permtrim(v3)),w3,var2,var3,msg,do_pos_neg)
 				val += tomul*shiftsub(val2)
-		elif inv(w)-inv(u)==2 and len(trimcode(u)) == len(trimcode(w)):
-			indices = []
-			for i in range(len(w)):
-				if i>=len(u) or u[i]!=w[i]:
-					indices += [i+1]
-			arr = [[[],v]]
-			d = -1
-			for i in range(len(v)-1):
-				if v[i]>v[i+1]:
-					d = i + 1
-			for i in range(d):
-				arr2 = []
-							
-				if i+1 in indices:
-					continue
-				i2 = 1
-				i2 += len([aa for aa in indices if i+1>aa])
-				for vr, v2 in arr:
-					dpret = pull_out_var(i2,[*v2])
-					for v3r, v3 in dpret:
-						arr2 += [[vr + [(v3r,i+1)],v3]]
-				arr = arr2
-			val = 0
-			
-			for L in arr:
-				v3 = [*L[-1]]
-				tomul = 1						
-				toadd = 1
-				for i in range(len(L[0])):
-					var_index = L[0][i][1]
-					oaf = L[0][i][0]
-					if var_index-1>=len(w):
-						yv = var_index
-					else:
-						yv = w[var_index-1]
-					for j in range(len(oaf)):				
-						toadd*= var2[yv] - var3[oaf[j]]
-				pooly = skew_div_diff(u,w,schubpoly(v3,[0,*[var2[a] for a in indices]],var3))
-				if toadd == 0:
-					continue
-				if pooly !=0:
-					coeff = compute_positive_rep(pooly,var2,var3,msg,False)
-				else:
-					coeff = 0
-				if coeff == -1:
-					return -1
-				tomul = sympify(coeff)
-				toadd*=tomul#.subs(subs_dict3)
-				val += toadd						
+		#elif inv(w)-inv(u)==2 and len(trimcode(u)) == len(trimcode(w)):
+		#	indices = []
+		#	for i in range(len(w)):
+		#		if i>=len(u) or u[i]!=w[i]:
+		#			indices += [i+1]
+		#	arr = [[[],v]]
+		#	d = -1
+		#	for i in range(len(v)-1):
+		#		if v[i]>v[i+1]:
+		#			d = i + 1
+		#	for i in range(d):
+		#		arr2 = []
+		#					
+		#		if i+1 in indices:
+		#			continue
+		#		i2 = 1
+		#		i2 += len([aa for aa in indices if i+1>aa])
+		#		for vr, v2 in arr:
+		#			dpret = pull_out_var(i2,[*v2])
+		#			for v3r, v3 in dpret:
+		#				arr2 += [[vr + [(v3r,i+1)],v3]]
+		#		arr = arr2
+		#	val = 0
+		#	
+		#	for L in arr:
+		#		v3 = [*L[-1]]
+		#		tomul = 1						
+		#		toadd = 1
+		#		for i in range(len(L[0])):
+		#			var_index = L[0][i][1]
+		#			oaf = L[0][i][0]
+		#			if var_index-1>=len(w):
+		#				yv = var_index
+		#			else:
+		#				yv = w[var_index-1]
+		#			for j in range(len(oaf)):				
+		#				toadd*= var2[yv] - var3[oaf[j]]
+		#		pooly = skew_div_diff(u,w,schubpoly(v3,[0,*[var2[a] for a in indices]],var3))
+		#		if toadd == 0:
+		#			continue
+		#		if pooly !=0:
+		#			coeff = compute_positive_rep(pooly,var2,var3,msg,False)
+		#		else:
+		#			coeff = 0
+		#		if coeff == -1:
+		#			return -1
+		#		tomul = sympify(coeff)
+		#		toadd*=tomul#.subs(subs_dict3)
+		#		val += toadd						
 		else:
 			if not sign_only:
 				if inv(u)+inv(v)-inv(w)==1:

{schubmult-1.4.1 → schubmult-1.4.2}/schubmult.egg-info/PKG-INFO

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

{schubmult-1.4.1 → schubmult-1.4.2}/setup.py

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