Extremal monotonicity conjecture for the side length function of regular polygon stars
Statement
Let be a regular polygon with sides, let denote the side length function for inscribed -pointed stars, and call a point of a midpoint crossing or vertex crossing according to whether the corresponding star has a midpoint coincidence or a vertex coincidence. For , Extremal monotonicity conjecture. Every midpoint crossing of is a global minimum of , every vertex crossing is a global maximum, midpoint and vertex crossings are interleaved around , and is strictly monotonic between adjacent midpoint and vertex crossings. This would strengthen the preceding partial characterization, which establishes that crossings are local extrema and that all crossings of each type have a common value; the conjectured global ordering and strict monotonicity remain unproved in the supplied text.
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.