ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,f)(X,f) be a finite connectivity system. Its ultrafilter width is

ufw⁡(X,f):=max⁡{k≥0∣there exists a non-principal ultrafilter of order k+1 on (X,f)},\operatorname{ufw}(X,f):=\max\{k\ge 0 \mid \text{there exists a non-principal ultrafilter of order } k+1 \text{ on } (X,f)\},

provided that at least one such ultrafilter exists. Connectivity-system SSE-type hardness conjecture. Under a suitable Small Set Connectivity Expansion Hypothesis for connectivity systems, it is NP-hard to approximate ufw⁡(X,f)\operatorname{ufw}(X,f) within a constant factor. This is an expansion-based computational hardness claim; the supplied text does not state the precise hypothesis or establish the reduction, so the conjectured hardness 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.