The general sweep-map bijectivity conjecture
Statement
Let be an alphabet and a weight function. For nonnegative integers , let be the words with the prescribed multiplicities, and let be those words whose levels relative to are all nonnegative. Sweep-map bijectivity conjecture. The map maps each of these two sets bijectively to itself. This asserts that the general sweep map preserves both content and the nonnegative-level condition.
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.