[#P3378] Finite group width versus finite monoid width
Contents
Problem. Let the width of a group (respectively, a monoid) H with respect to a generating set X mean the supremum over h ∈ H of the least length of a group word (respectively, a monoid word) in elements of X expressing h. A group (or monoid) is said to have finite width if its width with respect to every generating set is finite. (A common finite bound for these widths is not required.) Do there exist groups G having finite width as groups, but not as monoids? This is Question 9 in (G. M. Bergman, Bull. London Math. Soc., 38 (2006), 429-440). This is Kourovka Notebook Problem \(21.16\).
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 kourovka-21-16-finite-group-width-versus-finite-monoid-width: "Finite group width versus finite monoid width". Call orient with problem_ref "kourovka-21-16-finite-group-width-versus-finite-monoid-width", 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
- A support-three zero divisor over a torsion-free groupgroup theory
- A Tarski monster of exponent fivegroup theory
- Andrews-Curtis conjecturegroup theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Finite group width versus finite monoid width.” TheoremDB. P3378. Problem statement; statement identity tdbc1:276b284cf395b884f9e40488f3fde62c85682c22da65925dbb8ab73400fb2f10; statement text SHA-256 2c035d217f4bd808c6db0786abe57f2cce687e0fb54b3a3b59e289c5771524d0. https://theoremdb.org/statement/?ref=P3378
@misc{theoremdb-problem-2c035d217f4bd808c6db0786abe57f2cce687e0fb54b3a3b59e289c5771524d0,
title = {{Finite group width versus finite monoid width}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:276b284cf395b884f9e40488f3fde62c85682c22da65925dbb8ab73400fb2f10; statement text SHA-256 2c035d217f4bd808c6db0786abe57f2cce687e0fb54b3a3b59e289c5771524d0},
url = {https://theoremdb.org/statement/?ref=P3378}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.