ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A tree is a hypergraph whose hyperedges all have size two, and an LV-system is a Lotka–Volterra system associated with such a hypergraph. Two associated systems are LV-equivalent when they lie in the same equivalence class induced by linear transformations of the associated Lotka–Volterra systems. Tree non-equivalence conjecture. Nonisomorphic trees are not LV-equivalent. The statement has been confirmed for trees of order smaller than nine; its validity for larger orders 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 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.