Vakil's Maple script on small Grassmannians

	G(2,n)
n	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20
Problems	1	4	10	23	47	90	164	288	488	807	1303	2063	3210	4920	7434	11098	16380
Time (sec)	.01	.05	.20	.60	1.79	4.25	13.36	50.0	199.8	827.8	3083.9	9093	30530	182180	622495	849041	1500779

All Schubert problems on these G(2,n) were found to be at least alternating.

	G(3,n)
n	5	6	7	8	9	10	11
Unknown	0	2	3	7	14	24	48
Problems	4	39	270	1337	5786	22011	77305
Time (sec)	0.29	5.81	30.16	227.5	2825	26799	1004136

	G(4,n)
n	6	7	8	9
Unknown	0	3	33	233
Problems	10	270	3802	38760
Time (sec)	9.10	215.5	15807	830285

Last modified: Sat Aug 18 13:02:57 CDT 2018