The odd-configuration inversion conjecture
Statement
Let , and let denote the stable configurations reachable from by chip-firing. In the odd case, these configurations may be identified with permutations, and an inversion is a pair of entries in the permutation that occur in reverse order. Odd-configuration inversion conjecture. The maximum number of inversions among all permutations in is exactly
The conjecture concerns the structure of reachable stable configurations for odd . It had been verified in the source for odd , but no general proof was given.
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.