ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be an alphabet size, and let E[D,q]E[D,q] denote the set of expansive networks on a digraph DD over an alphabet of size qq, while EA[D,q]EA[D,q] denotes the set of abelian expansive networks on DD over that alphabet. Sharp distinction conjecture. For all qq, there exists a digraph DD such that

E[D,q]≠∅butEA[D,q]=∅.E[D,q] \ne \emptyset \quad\text{but}\quad EA[D,q] = \emptyset.

The conjecture asserts that expansive networks can exist on some digraphs even when no abelian expansive network exists, despite the proved bounds for complete graphs and the corresponding polynomial bound for linear networks. Whether such a distinction holds for every alphabet size 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.