One-corner conjecture for rearrangements of 1-Naples parking functions
Statement
Let be a positive integer, and let a parking preference be represented by its associated lattice-path diagram, with corners defined as turns of the path. Suppose that there is only one corner above the line . One-corner conjecture. That parking preference and all of its rearrangements are elements of . This conjecture concerns the characterization and enumeration of rearrangements of decreasing -Naples parking functions that remain -Naples parking functions. The paper presents it as an open conjecture for the case .
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.