Minimality conjecture for the generating sets of J_v_r,s,t,n
Statement
Let be the bigrassmannian permutation used in type , and let be its ideal. The two generating sets for this ideal given in Theorem~ are the generating sets under consideration. Minimality conjecture. Both generating sets are minimal. This has been verified computationally for all bigrassmannian permutations with and ; the conjecture would imply exponential lower bounds on the number of generators needed for certain ideals.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.