{"database": "team-science", "table": "adjacent_pair", "rows": [["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) \u00b7 withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal)", "withdrawn", null, "2026-09-02T18:02:06Z", null, null, null, null, null]], "columns": ["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"], "primary_keys": ["id"], "primary_key_values": ["ap-0efdf8ab99"], "units": {}, "query_ms": 0.6077112630009651, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}