Monotonicity conjecture for allowed patterns of symmetric tent maps
Statement
Let and be symmetric tent maps with , and let and be their commuter functions. Monotonicity conjecture.
Consequently, the range of is contained in the range of , and
The paper notes that a positive resolution requires proving that increases with ; numerical evidence supports this, but the conjecture remains open.
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.