Eriksson–Linusson's realizability conjecture for permutation arrays
Statement
A permutation array is an element of satisfying the permutation-array conditions, and denotes the corresponding permutation array variety, consisting of tuples of flags in in relative position . Eriksson–Linusson's realizability conjecture. Every permutation array can be realized by flags. Equivalently, every is nonempty. This conjecture asserts that the combinatorial permutation-array data always occur as the relative position of a tuple of flags; the supplied text gives no resolution status.
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.