Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant 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 87 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 85 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 419 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Generic length functions on countable groups (2206.10712v2)

Published 21 Jun 2022 in math.GR, math.LO, and math.MG

Abstract: Let $L(G)$ denote the space of integer-valued length functions on a countable group $G$ endowed with the topology of pointwise convergence. Assuming that $G$ does not satisfy any non-trivial mixed identity, we prove that a generic (in the Baire category sense) length function on $G$ is a word length and the associated Cayley graph is isomorphic to a certain universal graph $U$ independent of $G$. On the other hand, we show that every comeager subset of $L(G)$ contains $2{\aleph_0}$ asymptotically incomparable length functions. A combination of these results yields $2{\aleph_0}$ pairwise non-equivalent regular representations $G\to Aut(U)$. We also prove that generic length functions are virtually indistinguishable from the model-theoretic point of view. Topological transitivity of the action of $G$ on $L(G)$ by conjugation plays a crucial role in the proof of the latter result.

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

Collections

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

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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