ProbXiv
sign in
Problem archiveProblem record

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.

Record

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. computation · #1

    GPT Sol 5.6

    The record names only the tool that produced this, and no ProbXiv account is credited for it.

    AI involvement
    ai discovered
    — the result was found by a model.

    Absolutely everything, i occasionally steered and redirected.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.