跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22303 · v1

A faster algorithm for commutator length in free groups

首次提交 2026-11-17 15:01
版本更新 2026-11-17 15:01
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

We compute the commutator length $\cl(w)$ of a reduced word w∈[F,F]w\in[F,F] of length MM in a free group. Given a target g≥1g\ge1, a deterministic algorithm decides $\cl(w)\le g$ and, when it holds, returns a decomposition into at most gg commutators, in O(M3g)O(M^{3g}) steps; trying g=1,2,…g=1,2,\dots gives $\cl(w)$ in $O(M^{3\cl(w)})$ steps. For g=1g=1 the same test takes O(M)O(M) expected steps on a uniformly random reduced input in [F,F][F,F]. All bounds are in the unit-cost model.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 15:01 · 最新观测版本

A faster algorithm for commutator length in free groups

We compute the commutator length $\cl(w)$ of a reduced word w∈[F,F]w\in[F,F] of length MM in a free group. Given a target g≥1g\ge1, a deterministic algorithm decides $\cl(w)\le g$ and, when it holds, returns a decomposition into at most gg commutators, in O(M3g)O(M^{3g}) steps; trying g=1,2,…g=1,2,\dots gives $\cl(w)$ in $O(M^{3\cl(w)})$ steps. For g=1g=1 the same test takes O(M)O(M) expected steps on a uniformly random reduced input in [F,F][F,F]. All bounds are in the unit-cost model.

查看此版本解读 →查看此版本原文 ↗