Tournaments Determined by Three and Five Voters
Statement
Around the Kemeny median problem, which stays open for and voters, the paper refutes three conjectures on tournament inducibility: both conjectures of Milosz, Hamel and Pierrot (the 3-cycle extension for odd , and at ), and Shepard's threshold conjecture.
Context
Refutes three stated conjectures at once in the inducibility theory around the Kemeny median problem, a specialist but active corner of social choice.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The authors report using Claude for exploratory reasoning, implementation assistance, drafting and editing. Exploration and implementation are mathematical work; drafting and editing are not, and the disclosure does not separate them, so the lowest tier applies.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.