arXiv (All)
open access
No Uncountable Polish Group Can be a Right-Angled Artin Group
We prove that no uncountable Polish group can admit a system of generators whose associated length function satisfies the following conditions: (i) if $0 < k < ω$, then $lg(x) \leq lg(x^k)$; (ii) if $lg(y) < k < ω$ and $x^k = y$, then $x = e$. In particular, the automorphism group of a countable str
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Finite Quotients of Right-angled Artin Groups#1036334
- Grothendieck rigidity and virtual retraction of higher-rank GBS groups#986818
- The Codegree Isomorphism Conjecture for Finite Simple Groups#927969
- Unsolved Problems in Group Theory. The Kourovka Notebook#820102
- An explicit construction of a limit variety of groups#1341966
Record · ID 1390100
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive