Uniform sign-change conjecture for lattice random-walk averages
Statement
Let be fixed. For a finitely supported function , let denote the associated lattice random-walk quantity at and time . Uniform sign-change conjecture. For every such and every , the function has at most sign changes as a function of , where depends on and but not on . The conjecture would control the alternating sums in the proof and reduce the need to bound the error terms; it is motivated by the expectation that oscillations in the random-walk kernel occur only modulo .
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.