ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathbb{F} be a field. For a directed graph GG on nn vertices, its minrank over F\mathbb{F}, denoted by minrk⁡F(G)\operatorname{minrk}_{\mathbb{F}}(G), is the minimum rank over F\mathbb{F} of a matrix representing GG. An alternating odd cycle is a directed graph whose underlying undirected graph is an odd cycle and whose edge orientations alternate, with one exception.

Odd Alternating Cycle Conjecture. For every field F\mathbb{F} there exist ε>0\varepsilon>0 and an odd integer ℓ\ell such that every nn-vertex directed graph GG with

minrk⁡F(G)≤ε⋅n\operatorname{minrk}_{\mathbb{F}}(G)\leq\varepsilon\cdot n

contains an alternating cycle of length ℓ\ell.

The conjecture was proposed in connection with circuit-complexity questions and Valiant's approach to circuit lower bounds. It was disproved over the real field, while its status over finite fields remained open in the source context.

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.