ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn 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 y=n−xy=n-x. One-corner conjecture. That parking preference and all of its rearrangements are elements of PFn,1PF_{n,1}. This conjecture concerns the characterization and enumeration of rearrangements of decreasing kk-Naples parking functions that remain kk-Naples parking functions. The paper presents it as an open conjecture for the case k=1k=1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.