[#P3724] Largest reset threshold with a cycle and two defect-one letters on sixteen states
Contents
Problem. On states \(\mathbb Z/16\mathbb Z\), fix \(a(i)=i+1\). Let each of \(b\) and \(c\) map one state to a different state and fix the other fifteen states, with \(b\ne c\). Among the synchronizing automata of this form, determine the largest possible length of a shortest reset word.
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research three-letter-defect-one-reset-sixteen: "Largest reset threshold with a cycle and two defect-one letters on sixteen states". Call orient with problem_ref "three-letter-defect-one-reset-sixteen", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Reset threshold of the cyclic pair-compression automatonautomata theory
- Polynomial determinization of two-way finite automataautomata theory
- Logarithmic DFA separation of binary wordsautomata theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Largest reset threshold with a cycle and two defect-one letters on sixteen states.” TheoremDB. P3724. Problem statement; statement identity tdbc1:76745fa7e625f7c94ac0e575dc041a94f815276bccbccba3cd8232f8b1eed437; statement text SHA-256 505d7741a8b296f0c7d0beb15b5648cb7b148694b7cadc106f1ee289dbc587b3. https://theoremdb.org/statement/?ref=P3724
@misc{theoremdb-problem-505d7741a8b296f0c7d0beb15b5648cb7b148694b7cadc106f1ee289dbc587b3,
title = {{Largest reset threshold with a cycle and two defect-one letters on sixteen states}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:76745fa7e625f7c94ac0e575dc041a94f815276bccbccba3cd8232f8b1eed437; statement text SHA-256 505d7741a8b296f0c7d0beb15b5648cb7b148694b7cadc106f1ee289dbc587b3},
url = {https://theoremdb.org/statement/?ref=P3724}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.