Curto et al.'s Minimality Conjecture for Threshold-Linear Networks
Statement
Curto et al. (Advances in Applied Mathematics, 2024) conjectured that every stable fixed point of a threshold-linear network is minimal. Disproved: an explicit competitive 3-neuron TLN has a stable fixed point whose support strictly contains another's, and 3 neurons is proven smallest possible.
Record
- Source
- Added
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
construction · #1
Jesse Geneson, using GPT-5That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
"We used GPT-5 to find the 3-neuron counterexample and to draft some of the expository text." The minimality of the construction and the expansions to larger networks are the author's.
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.