arXiv (All)
open access
Conjugator Length in Iterated Cyclic Amalgams of Free Groups
Let $\mathcal{A}_0$ be the set of finitely generated free groups on some countable alphabet and and define $\mathcal{A}_r$ inductively as the union of $\mathcal{A}_{r-1}$ with the set of amalgamated free products $G_1\ast_{\ZZ}G_2$, where $G_1,G_2\in \mathcal{A}_{r-1}$. We show, for all $r$, that ev
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
- Length-generating functions for twisted involutions of Coxeter groups#985401
- Asymptotic dimension of commutative monoid actions#1063165
- Equal knapsack identities between symmetric group character degrees#1012061
- On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups#822289
- Polynomial Bohnenblust--Hille bounds for product of cyclic groups#987895
Record · ID 1049979
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