Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 93 tok/s Pro
Kimi K2 156 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Bavard's duality theorem for mixed commutator length (2007.02257v4)

Published 5 Jul 2020 in math.GR, math.AT, and math.GT

Abstract: Let $N$ be a normal subgroup of a group $G$. A quasimorphism $f$ on $N$ is $G$-invariant if $f(gxg{-1}) = f(x)$ for every $g \in G$ and every $x \in N$. The goal in this paper is to establish Bavard's duality theorem of $G$-invariant quasimorphisms, which was previously proved by Kawasaki and Kimura in the case $N = [G,N]$. Our duality theorem provides a connection between $G$-invariant quasimorphisms and $(G,N)$-commutator lengths. Here for $x \in [G,N]$, the $(G,N)$-commutator length $\mathrm{cl}{G,N}(x)$ of $x$ is the minimum number $n$ such that $x$ is a product of $n$ commutators which are written as $[g,x]$ with $g \in G$ and $h \in N$. In the proof, we give a geometric interpretation of $(G,N)$-commutator lengths. As an application of our Bavard duality, we obtain a sufficient condition on a pair $(G,N)$ under which $\mathrm{scl}_G$ and $\mathrm{scl}{G,N}$ are bi-Lipschitzly equivalent on $[G,N]$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube