Count the shortest routes in the relevant subspace lattice for which every visited corner (i,j) satisfies j\geq i.
Statement
Count the shortest routes in the relevant subspace lattice for which every visited corner (i,j) satisfies j\geq i.
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.