schubmult 1.4.0__tar.gz → 1.4.2__tar.gz

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: schubmult
-Version: 1.4.0
+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.0 → schubmult-1.4.2}/schubmult/perm_lib.py

@@ -153,7 +153,7 @@ def elem_sym_perms_op(orig_perm,p,k):
 			up_perm2 = [*up_perm]
 			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 up_perm2[i] == orig_perm[i]]
+			pos_list = [i for i in range(k) if getpermval(up_perm2,i) == getpermval(orig_perm,i)]
 			for j in range(last,len(up_perm2)):				
 				for i in pos_list:								
 					if has_bruhat_descent(up_perm2,i,j):
@@ -234,7 +234,97 @@ def elem_sym_perms_q_op(orig_perm,p,k,n):
 		up_perm_list = perm_list
 	return total_list
 
+qvar_list = q_var.tolist()
 
+def q_vector(q_exp):
+	ret = []
+	
+	if q_exp == 1:
+		return ret
+	if q_exp in q_var:
+		i = qvar_list.index(q_exp)
+		ret = [0 for j in range(i-1)] + [1]
+		return ret
+	if isinstance(q_exp, Pow):
+		qv = q_exp.args[0]
+		expon = int(q_exp.args[1])
+		i = qvar_list.index(qv)
+		ret = [0 for j in range(i-1)] + [expon]
+		return ret
+	if isinstance(q_exp, Mul):	
+		for a in q_exp.args:
+			v1 = q_vector(a)
+			v1 += [0 for i in range(len(v1),len(ret))]
+			ret += [0 for i in range(len(ret),len(v1))]
+			ret = [ret[i] + v1[i] for i in range(len(ret))]
+		return ret
+		
+	return None
+
+def omega(i,qv):
+	i = i - 1
+	if len(qv) == 0 or i > len(qv):
+		return 0
+	if i == 0:
+		if len(qv) == 1:
+			return 2*qv[0]
+		return 2*qv[0] - qv[1]
+	if i == len(qv):
+		return -qv[-1]
+	if i == len(qv) - 1:
+		return 2*qv[-1] - qv[-2]
+	return 2*qv[i] - qv[i-1] - qv[i+1]
+
+def sg(i,w):
+	if i>=len(w) - 1 or w[i]<w[i+1]:
+		return 0
+	return 1
+
+def reduce_q_coeff(u, v, w, qv):
+	for i in range(len(qv)):
+		if (i<len(u)-1 and u[i]>u[i+1] and (i>=len(v)-1 or v[i]<v[i+1]) and (i>=len(w)-1 or w[i]<w[i+1]) and sg(i,w) + omega(i+1,qv) == 1):
+			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]
+			qv_ret[i] -= 1
+			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 (i>=len(w)-1 or w[i]<w[i+1]) and sg(i,w) + omega(i+1,qv) == 1):
+			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]
+			qv_ret[i] -= 1
+			return u, tuple(permtrim(ret_v)), tuple(permtrim(ret_w)), qv_ret, True
+		elif (i<len(u)-1 and u[i]>u[i+1] and i<len(v)-1 and v[i]>v[i+1] and sg(i,w)+omega(i+1,qv)  == 2):
+			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]
+			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
 def kdown_perms(perm,monoperm,p,k):	
 	inv_m = inv(monoperm)

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

@@ -1,5 +1,6 @@
 from schubmult.perm_lib import *
 from schubmult.schubmult_yz import compute_positive_rep, posify
+import schubmult.schubmult_yz as norm_yz
 from symengine import *
 import sys
 
@@ -242,6 +243,11 @@ def schubmult_db(perm_dict,v,var2=var2,var3=var3):
 		ret_dict = add_perm_dict({ep: vpathsums[ep].get(toget,0) for ep in vpathsums},ret_dict)
 	return ret_dict
 
+def div_diff(v,w,var2=var2,var3=var3):
+	coeff_dict = {v: 1}
+	coeff_dict = norm_yz.schubmult_down(coeff_dict,w,var2,var3)
+	return coeff_dict.get((1,2),0)
+
 q_var2 = q_var.tolist()
 
 def sum_q_dict(q_dict1,q_dict2):
@@ -359,6 +365,7 @@ def main():
 		ascode = False
 		coprod = False
 		nilhecke = False
+		nilhecke_apply = False
 		check = True
 		msg = False
 		just_nil = False
@@ -408,6 +415,10 @@ def main():
 					nilhecke = True
 					just_nil = True
 					continue
+				if s == "-nil-hecke-apply":
+					nilhecke_apply = True
+					just_nil = True
+					continue
 				if s == "--version":
 					print(f"Python version {sys.version}")
 					exit(0)
@@ -443,7 +454,13 @@ def main():
 		
 		if nilhecke:
 			coeff_dict = nil_hecke({(1,2): 1},perms[0],nil_N)			
-			rep = ("y","x")		
+			rep = ("y","x")
+		elif nilhecke_apply:
+			coeff_dict0 = nil_hecke({(1,2): 1},perms[0],nil_N,var2,var2)
+			coeff_dict = {(1,2): 0}
+			for v in coeff_dict0:
+				coeff_dict[(1,2)] += coeff_dict0[v]*div_diff(v,perms[1],var2,var3)
+			rep = ("y","x")			
 		else:
 			coeff_dict = {perms[0]: 1}
 			for perm in perms[1:]:
@@ -491,22 +508,28 @@ def main():
 									val2 += q_part*int(q_dict[q_part])
 								except Exception:
 									try:
-										if len(perms) == 2 and q_part == 1 and not mult:
-											u = permtrim([*perms[0]])
-											v = permtrim([*perms[1]])
-											val2 += posify(q_dict[q_part],tuple(u),tuple(v),perm,var2_t,var3_t,msg,False)
-										elif len(perms) == 2 and q_part in q_var2 and not mult:
-											i = q_var2.index(q_part)
-											u = permtrim([*perms[0]])
-											v = permtrim([*perms[1]])											
-											#print(f"{u=} {v=} {q_part=} {q_dict[q_part]=}")
-											if i<len(u) and i<len(v) and u[i-1]>u[i] and v[i-1]>v[i]:
-												u[i], u[i-1] = u[i-1], u[i]
-												v[i], v[i-1] = v[i-1], v[i]
-												#print(f"new {u=} {v=}")
-												val2 += q_part*posify(q_dict[q_part],tuple(permtrim(u)),tuple(permtrim(v)),perm,var2_t,var3_t,msg,False)
+										if len(perms) == 2:
+											u = tuple(permtrim([*perms[0]]))
+											v = tuple(permtrim([*perms[1]]))
+										if len(perms) == 2 and code(inverse(perms[1])) == medium_theta(inverse(perms[1])) and not mult and not slow and not nilhecke_apply:
+											val2 += q_part*q_dict[q_part]
 										else:
-											val2 += q_part*compute_positive_rep(q_dict[q_part],var2_t,var3_t,msg,False)
+											q_part2 = q_part
+											if not mult and not nilhecke_apply and len(perms) == 2:
+												qv = q_vector(q_part)
+												u2, v2, w2 = u, v, perm
+												u2, v2, w2, qv, did_one = reduce_q_coeff(u2, v2, w2, qv)
+												while did_one:
+													u2, v2, w2, qv, did_one = reduce_q_coeff(u2, v2, w2, qv)
+												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(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)
+											else:
+												val2 += q_part*compute_positive_rep(q_dict[q_part],var2_t,var3_t,msg,False)
 									except Exception as e:
 										if mult:
 											print("warning; --display-positive is on but result is not positive",file=sys.stderr)
@@ -515,12 +538,14 @@ def main():
 										else:
 											print(f"error; write to schubmult@gmail.com with the case {perms=} {perm=} {val=} {coeff_dict.get(perm,0)=}")
 											print(f"Exception: {e}")
+											import traceback
+											traceback.print_exc()
 											exit(1)
 							if check and expand(val - val2)!=0:
 								if mult:
 									val2 = val
 								else:
-									print(f"error: value not equal; write to schubmult@gmail.com with the case {perms=} {perm=} {val=} {coeff_dict.get(perm,0)=}")
+									print(f"error: value not equal; write to schubmult@gmail.com with the case {perms=} {perm=} {val2=} {coeff_dict.get(perm,0)=}")
 									exit(1)
 							val = val2
 					if expa:

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

@@ -129,7 +129,21 @@ def mult_poly_down(coeff_dict,poly):
 			ret[perm] = poly*coeff_dict[perm]
 		return ret
 
-
+def nilhecke_mult(coeff_dict1,coeff_dict2):
+	ret = {}
+	for w in coeff_dict2:
+		w1 = [*w]
+		inv_w1 = inv(w1)
+		poly = coeff_dict2[w]
+		did_mul = mult_poly_down(coeff_dict1,poly)
+		for v in did_mul:
+			v1 = [*v1]
+			addperm = mulperm(v1,w1)
+			if inv(addperm) == inv(v1) + inv_w1:
+				toadd = tuple(permtrim(addperm))
+				ret[toadd] = ret.get(toadd,0) + did_mul[v]
+	return ret
+	
 def forwardcoeff(u,v,perm,var2=var2,var3=var3):
 	th = theta(v)
 	muv = uncode(th)
@@ -1301,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:
-			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.0 → schubmult-1.4.2}/schubmult.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: schubmult
-Version: 1.4.0
+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.0 → schubmult-1.4.2}/setup.py

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