schubmult 1.4.2__tar.gz → 1.4.3__tar.gz

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

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

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

@@ -282,49 +282,85 @@ def sg(i,w):
 
 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):
+		if sg(i,v) == 1 and sg(i,u) == 0 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
+			if sg(i,w) == 0:
+				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):
+		elif sg(i,u) == 1 and sg(i,v) == 0 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]
-			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:
+			if sg(i,w) == 0:
+				qv_ret[i] -= 1		
+		elif sg(i,u) == 1 and sg(i,v) == 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]
-			#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
+			if sg(i,w) == 0:
+				qv_ret[i] -= 1
+			return tuple(permtrim(ret_u)), v, tuple(permtrim(ret_w)), qv_ret, True		
 	return u, v, w, qv, False
-		
+
+def longest_element(indices):
+	perm = [1,2]
+	did_one = True
+	while did_one:
+		did_one = False
+		for i in range(len(indices)):
+			j = indices[i]-1
+			if sg(j,perm) == 0:
+				if len(perm)<j+2:
+					perm = perm+[index for index in range(len(perm)+1,j+3)]
+				perm[j], perm[j+1] = perm[j+1],perm[j]
+				did_one = True
+	return permtrim(perm)
+
+def count_less_than(arr,val):
+	ct = 0
+	i = 0
+	while i<len(arr) and arr[i]<val:
+		i += 1
+		ct += 1
+	return ct
+
+
+def is_parabolic(w,parabolic_index):
+	for i in parabolic_index:
+		if sg(i-1,w) == 1:
+			return False
+	return True
+
+def check_blocks(qv,parabolic_index):
+	blocks = []
+	cur_block = []
+	last_val = -1
+	for i in range(len(parabolic_index)):
+		if last_val == -1 or last_val + 1 == parabolic_index[i]:
+			last_val = parabolic_index[i]
+			cur_block += [last_val]
+		else:
+			blocks += [cur_block]
+			cur_block = []
+	for block in blocks:
+		for i in range(len(block)):
+			for j in range(i,len(block)):
+				val = 0
+				for k in range(i,j+1):
+					val += omega(block[k],qv)
+				if val != 0 and val != -1:
+					return False
+	return True
+
+	
 # perms and inversion diff
 def kdown_perms(perm,monoperm,p,k):	
 	inv_m = inv(monoperm)

{schubmult-1.4.2 → schubmult-1.4.3}/schubmult/schubmult_q/schubmult_q.py

@@ -2,6 +2,7 @@ from symengine import *
 from functools import cache
 from itertools import chain
 from schubmult.perm_lib import *
+from schubmult.schubmult_q_yz import factor_out_q_keep_factored
 import schubmult.schubmult_yz as yz
 import sys
 
@@ -16,6 +17,7 @@ subs_dict = {}
 
 var_x = symarray("x",100).tolist()
 
+
 def single_variable(coeff_dict,varnum):
 	ret = {}
 	for u in coeff_dict:
@@ -264,6 +266,9 @@ def main():
 		mult = False
 		mulstring = ""
 		slow = False
+		parabolic = False
+		just_parabolic = False
+		parabolic_index = []
 		
 		try:
 			for s in sys.argv[1:]:
@@ -273,6 +278,15 @@ def main():
 				if s == "--slow":
 					slow = True
 					continue
+				if s == "-parabolic":
+					just_parabolic = True
+					parabolic = True
+					continue
+				if just_parabolic:
+					just_parabolic = False
+					parabolic_index = [int(i) for i in s.split(",")]
+					parabolic_index.sort()
+					continue
 				if mult:
 					mulstring += s
 					continue
@@ -300,12 +314,16 @@ def main():
 		except Exception:
 			print("**** schubmult_q ****")
 			print("Purpose: Compute the structure constants of quantum Schubert polynomials")
-			print("Usage: schubmult_q <-np|--no-print> <-code> <-grass n> <-equiv> perm1 - perm2 < - perm 3 ... >")
-			print("For the -grass option, must use Grassmannian permutations. -equiv only works together with -grass.")
+			print("Usage: schubmult_q <-np|--no-print> <-parabolic descent1,descent2,...> <-code> <-grass n> <-equiv> perm1 - perm2 < - perm 3 ... >")
+			#print("For the -grass option, must use Grassmannian permutations. -equiv only works together with -grass.")			
 			exit(1)
 		
 		perms += [curperm]
 		
+		if parabolic and len(perms) != 2:
+			print("Only two permutations supported for parabolic.")
+			exit(1)
+							
 		
 		if grass:
 			perms_t = []
@@ -432,6 +450,13 @@ def main():
 				for i in range(len(perms)):
 					perms[i] = uncode(perms[i])
 		
+			if parabolic:
+				for i in range(len(parabolic_index)):
+					index = parabolic_index[i] - 1
+					if sg(index,perms[0]) == 1 or sg(index,perms[1]) == 1:
+						print("Parabolic given but elements are not minimal length coset representatives.")
+						exit(1)
+		
 			coeff_dict = {tuple(permtrim([*perms[0]])): 1}
 			
 			if not slow:
@@ -445,12 +470,51 @@ def main():
 				mul_exp = sympify(mulstring)
 				coeff_dict = mult_poly(coeff_dict,mul_exp)
 				
-			if pr:
+			if pr:						
 				if ascode:
 					width = max([len(str(trimcode(perm))) for perm in coeff_dict.keys() if expand(coeff_dict[perm])!=0])
 				else:
 					width = max([len(str(perm)) for perm in coeff_dict.keys() if expand(coeff_dict[perm])!=0])
 				
+				if parabolic:
+					w_P = longest_element(parabolic_index)
+					w_P_prime = [1,2]
+					coeff_dict_update = {}
+					for w_1 in coeff_dict:
+						val = coeff_dict[w_1]
+						q_dict = factor_out_q_keep_factored(val)
+						for q_part in q_dict:
+							qv = q_vector(q_part)
+							w = [*w_1]
+							good = True
+							parabolic_index2 = []
+							for i in range(len(parabolic_index)):							
+								if omega(parabolic_index[i],qv) == 0:
+									parabolic_index2 += [parabolic_index[i]]
+								elif omega(parabolic_index[i],qv) != -1:
+									good = False
+									break
+							if not good:
+								continue
+							w_P_prime = longest_element(parabolic_index2)
+							if not check_blocks(qv,parabolic_index):
+								continue
+							w = permtrim(mulperm(mulperm(w,w_P_prime),w_P))
+							if not is_parabolic(w,parabolic_index):							
+								continue
+					
+							w = tuple(permtrim(w))
+							
+							new_q_part = np.prod([q_var[index+1-count_less_than(parabolic_index,index+1)]**qv[index] for index in range(len(qv)) if index+1 not in parabolic_index])
+							
+							try:
+								new_q_part = int(new_q_part)
+							except Exception:
+								pass
+							q_val_part = q_dict[q_part]
+							coeff_dict_update[w] = coeff_dict_update.get(w,0) + new_q_part*q_val_part
+					coeff_dict = coeff_dict_update
+				
 				coeff_perms = list(coeff_dict.keys())
 				coeff_perms.sort(key=lambda x: (inv(x),*x))
 				
@@ -458,9 +522,9 @@ def main():
 					val = sympify(coeff_dict[perm]).expand()
 					if val != 0:
 						if ascode:					
-							print(f"{str(trimcode(perm)):>{width}}  {str(val).replace('**','^').replace('*',' ')}")
+							print(f"{str(trimcode(perm))}  {str(val).replace('**','^').replace('*',' ')}")
 						else:
-							print(f"{str(perm):>{width}}  {str(val).replace('**','^').replace('*',' ')}")
+							print(f"{str(perm)}  {str(val).replace('**','^').replace('*',' ')}")
 	except BrokenPipeError:
 		pass
 			

{schubmult-1.4.2 → schubmult-1.4.3}/schubmult/schubmult_q_double/schubmult_q_double.py

@@ -1,5 +1,5 @@
 from schubmult.perm_lib import *
-from schubmult.schubmult_q_yz import schubmult, schubmult_db, mult_poly
+from schubmult.schubmult_q_yz import schubmult, schubmult_db, mult_poly, factor_out_q_keep_factored
 from symengine import *
 import sys
 
@@ -39,6 +39,10 @@ def main():
 		mult = False
 		slow = False
 		mulstring = ""
+		parabolic = False
+		just_parabolic = False
+		parabolic_index = []
+		
 		try:
 			for s in sys.argv[1:]:
 				if s == "-np" or s == "--no-print":
@@ -47,6 +51,15 @@ def main():
 				if s == "--slow":
 					slow = True
 					continue
+				if s == "-parabolic":
+					just_parabolic = True
+					parabolic = True
+					continue
+				if just_parabolic:
+					just_parabolic = False
+					parabolic_index = [int(i) for i in s.split(",")]
+					parabolic_index.sort()
+					continue
 				if mult:
 					mulstring += s
 					continue
@@ -71,7 +84,7 @@ def main():
 				if s == "--usage":
 					print("**** schubmult_q_double ****")
 					print("Purpose: Compute equivariant Gromov-Witten invariants, structure constants of quantum double Schubert polynomials")
-					print("Usage: schubmult_q_double <-np|--no-print> <-code> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. >")
+					print("Usage: schubmult_q_double <-np|--no-print> <-parabolic descent1,descent2,...> <-code> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. >")
 					#print("Alternative usage: schubmult_yz <-code> <--display-positive> -coprod perm - indexlist")
 					exit(0)
 				if s == "-":
@@ -82,7 +95,7 @@ def main():
 		except Exception:
 			print("**** schubmult_q_double ****")
 			print("Purpose: Compute equivariant Gromov-Witten invariants, structure constants of quantum double Schubert polynomials")
-			print("Usage: schubmult_q_double <-np|--no-print> <-code> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. >")
+			print("Usage: schubmult_q_double <-np|--no-print> <-code> <-parabolic descent1,descent2,...> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. >")
 			exit(1)
 				
 		perms += [curperm]
@@ -109,6 +122,46 @@ def main():
 			coeff_dict = mult_poly(coeff_dict,mul_exp)
 		
 		if pr:
+		
+			if parabolic:
+				w_P = longest_element(parabolic_index)
+				w_P_prime = [1,2]
+				coeff_dict_update = {}
+				for w_1 in coeff_dict:
+					val = coeff_dict[w_1]
+					q_dict = factor_out_q_keep_factored(val)
+					for q_part in q_dict:
+						qv = q_vector(q_part)
+						w = [*w_1]
+						good = True
+						parabolic_index2 = []
+						for i in range(len(parabolic_index)):							
+							if omega(parabolic_index[i],qv) == 0:
+								parabolic_index2 += [parabolic_index[i]]
+							elif omega(parabolic_index[i],qv) != -1:
+								good = False
+								break
+						if not good:
+							continue
+						w_P_prime = longest_element(parabolic_index2)
+						if not check_blocks(qv,parabolic_index):
+							continue
+						w = permtrim(mulperm(mulperm(w,w_P_prime),w_P))
+						if not is_parabolic(w,parabolic_index):							
+							continue
+				
+						w = tuple(permtrim(w))
+						
+						new_q_part = np.prod([q_var[index+1-count_less_than(parabolic_index,index+1)]**qv[index] for index in range(len(qv)) if index+1 not in parabolic_index])
+						
+						try:
+							new_q_part = int(new_q_part)
+						except Exception:
+							pass
+						q_val_part = q_dict[q_part]						
+						coeff_dict_update[w] = coeff_dict_update.get(w,0) + new_q_part*q_val_part
+				coeff_dict = coeff_dict_update
+		
 			if ascode:
 				width = max([len(str(trimcode(perm))) for perm in coeff_dict.keys() if expand(sympify(coeff_dict[perm]).subs(subs_dict))!=0])
 			else:
@@ -127,9 +180,9 @@ def main():
 						notint = True
 					if val!=0:
 						if ascode:
-							print(f"{str(trimcode(perm)):>{width}}  {str(val).replace('**','^').replace('*',' ')}")	
+							print(f"{str(trimcode(perm))}  {str(val).replace('**','^').replace('*',' ')}")	
 						else:
-							print(f"{str(perm):>{width}}  {str(val).replace('**','^').replace('*',' ')}")	
+							print(f"{str(perm)}  {str(val).replace('**','^').replace('*',' ')}")	
 	except BrokenPipeError:
 		pass
 		

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

@@ -347,7 +347,7 @@ var3_t = tuple(var3.tolist())
 def print_usage():
 	print("**** schubmult_q_yz ****")
 	print("Purpose: Compute Molev-Sagan coefficients of quantum double Schubert polynomials")
-	print("Usage: schubmult_q_yz <-np|--no-print> <-code> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. > <-mult poly_expression>")
+	print("Usage: schubmult_q_yz <-np|--no-print> <-parabolic descent1,descent2,...> <-code> <--display-positive> <--optimizer-message> perm1 - perm2 < - perm3 .. > <-mult poly_expression>")
 	print("       *** Computes products")
 	print("Alternative usage: schubmult_q_yz -nil-hecke n <-code> <--display-positive> perm")
 	print("       *** Computes nil-Hecke representation of quantum double Schubert polynomial, limiting to the group S_n")
@@ -371,6 +371,9 @@ def main():
 		just_nil = False
 		mult = False
 		slow = False
+		parabolic = False
+		just_parabolic = False
+		parabolic_index = []
 		
 		nil_N = 0
 		
@@ -390,6 +393,14 @@ def main():
 				if s == "--norep":
 					norep = True
 					continue
+				if s == "-parabolic":
+					just_parabolic = True
+					parabolic = True
+					continue
+				if just_parabolic:
+					just_parabolic = False
+					parabolic_index = [int(i) for i in s.split(",")]
+					continue
 				if s == "--expand":
 					expa = True
 					continue
@@ -452,6 +463,17 @@ def main():
 		size = 0
 		L = len(perms)
 		
+		if parabolic and len(perms) != 2:
+			print("Only two permutations supported for parabolic.")
+			exit(1)
+			
+		if parabolic:
+			for i in range(len(parabolic_index)):
+				index = parabolic_index[i] - 1
+				if sg(index,perms[0]) == 1 or sg(index,perms[1]) == 1:
+					print("Parabolic given but elements are not minimal length coset representatives.")
+					exit(1)
+		
 		if nilhecke:
 			coeff_dict = nil_hecke({(1,2): 1},perms[0],nil_N)			
 			rep = ("y","x")
@@ -483,10 +505,72 @@ def main():
 			rep = ("","")			
 		
 		if pr:
-			#if ascode:
-			#	width = max([len(str(trimcode(perm))) for perm in coeff_dict.keys() if expand(coeff_dict[perm])!=0])
-			#else:
-			#	width = max([len(str(perm)) for perm in coeff_dict.keys() if expand(coeff_dict[perm])!=0])
+			posified = False
+			if parabolic:
+				if display_positive:
+					posified = True
+				w_P = longest_element(parabolic_index)
+				w_P_prime = [1,2]
+				coeff_dict_update = {}
+				for w_1 in coeff_dict:
+					val = coeff_dict[w_1]
+					q_dict = factor_out_q_keep_factored(val)
+					for q_part in q_dict:
+						qv = q_vector(q_part)
+						w = [*w_1]
+						good = True
+						parabolic_index2 = []
+						for i in range(len(parabolic_index)):							
+							if omega(parabolic_index[i],qv) == 0:
+								parabolic_index2 += [parabolic_index[i]]
+							elif omega(parabolic_index[i],qv) != -1:
+								good = False
+								break
+						if not good:
+							continue
+						w_P_prime = longest_element(parabolic_index2)
+						if not check_blocks(qv,parabolic_index):
+							continue
+						w = permtrim(mulperm(mulperm(w,w_P_prime),w_P))
+						if not is_parabolic(w,parabolic_index):							
+							continue
+				
+						w = tuple(permtrim(w))
+						
+						new_q_part = np.prod([q_var[index+1-count_less_than(parabolic_index,index+1)]**qv[index] for index in range(len(qv)) if index+1 not in parabolic_index])
+						
+						try:
+							new_q_part = int(new_q_part)
+						except Exception:
+							pass
+						q_val_part = q_dict[q_part]
+						if display_positive:
+							try:
+								q_val_part = int(q_val_part)
+							except Exception:
+								try:
+									if len(perms) == 2 and q_part == 1:
+										u = permtrim([*perms[0]])
+										v = permtrim([*perms[1]])
+										q_val_part = posify(q_dict[q_part],tuple(u),tuple(v),w_1,var2_t,var3_t,msg,False)
+									else:
+										qv = q_vector(q_part)
+										u2, v2, w2 = perms[0], perms[1], w_1
+										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)
+												#print(f"new {u=} {v=}")
+										q_part2 = np.prod([q_var[i+1]**qv[i] for i in range(len(qv))])
+										if q_part2 == 1:
+											q_val_part = posify(q_dict[q_part],u2,v2,w2,var2_t,var3_t,msg,False)
+										else:
+											q_val_part = compute_positive_rep(q_dict[q_part],var2_t,var3_t,msg,False)
+								except Exception as e:
+									print(f"error; write to schubmult@gmail.com with the case {perms=} {perm=} {q_part*q_val_part=} {coeff_dict.get(w_1,0)=}")
+									print(f"Exception: {e}")
+									exit(1)
+						coeff_dict_update[w] = coeff_dict_update.get(w,0) + new_q_part*q_val_part
+				coeff_dict = coeff_dict_update
 			
 			coeff_perms = list(coeff_dict.keys())
 			coeff_perms.sort(key=lambda x: (inv(x),*x))
@@ -500,7 +584,7 @@ def main():
 					except Exception:
 						notint = True
 						val2 = 0
-						if display_positive:
+						if display_positive and not posified:
 							q_dict = factor_out_q_keep_factored(val)
 							for q_part in q_dict:
 								#print(f"{q_part=} {q_dict[q_part]=}")
@@ -527,6 +611,7 @@ def main():
 													#	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:
+													#print("Failed to posify")
 													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)

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

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

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

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