adjacent_pair: ap-0efdf8ab99

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

id a_kind a_ref a_label b_kind b_ref b_label bridge distance novelty evidence status asked_by created_ts signal score why prompt reading
ap-0efdf8ab99 problem se-cstheory-42654 A conjecture related to the Cerny conjecture - counterexample/reference request. The Cerny conjecture is the statement that any synchronizing automaton with $n$ states has a synchronizing word of length at most $(n-1)^2$ . The best current upper bound for the length of a synchronizing word is $O(n^3 problem se-mo-10752 Enumerating (generalized) de Bruijn tori. Given a cyclic word $w$ of length $N$ over a $q$-ary alphabet and $k \in \mathbb{Z}_+$, consider the directed multigraph $G_k(w) = (V,E)$ with $V \subset$ {$1,\dots,q$}$^k$ given by the $k$-lets (i.e., subwords of $k$ symbols) that appear in $w$ (without mul word length adjacent-field novel 0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) ยท withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal) withdrawn   2026-09-02T18:02:06Z          

Links from other tables