Score-Determined Induced Tournament Statistics: an All-Orders Classification
Statement
A tournament orients every pair in a round-robin (winner → loser). The score sequence is the sorted win-count list. Reversing a directed 3-cycle never changes scores, so score-equivalent tournaments can look structurally different.
Question: Which linear combinations of induced k-subtournament type-counts are score-determined — identical across all tournaments sharing a score sequence, at any host size?
Answer: Exactly the linear combinations of degree-multiplicity counts m₀,…,m_{k−1}, where mᵣ counts how many of the k chosen vertices have exactly r internal wins. These k functions satisfy one linear relation, so score-determined statistics have dimension k−1.
Context
A clean and natural classification question, but self-posed and resolved in the same work - no prior literature poses it. Scored at the self-posed floor, and no systematic prior-art sweep has been done by the author or this site, so even novelty is unconfirmed.
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.
Absolutely everything, i occasionally steered and redirected.
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.