The reduced Gr_2-simplex recurrence conjecture
Statement
Let denote the integer in the reduced -simplex in layer , row , and NE-SW diagonal , and set when there is no entry in that position. Reduced -simplex recurrence conjecture.
The recurrence is asserted to hold without the exceptions needed for the unreduced -simplex, providing a uniform combinatorial rule for the reduced array.
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.