ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,T)(X,T) be an efficiently discretizable topological dynamical system. Recall that TT is topologically exact if, for every nonempty open set U⊂XU\subset X, there exists n0∈Nn_0\in\mathbb{N} such that Tn0(U)=XT^{n_0}(U)=X. A telic problem is called hard-on-average when it satisfies the stated almost-everywhere average-case hardness condition.

Topological exactness conjecture. If TT is topologically exact and the system admits a hard telic problem, then there exists an almost-everywhere δ\delta hard-on-average telic problem coming from the dynamical system.

The conjecture is motivated by the possible construction of one-way functions from dynamical systems with hard telic problems. Its resolution is not supplied in the source.

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.