arXiv (All)
open access
Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups
In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the norm
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
- Sharp edge-spectral supersaturation for odd cycles#985469
- Practical Linear-Time Computation of Smallest Suffixient Sets#665834
- Practical Linear-Time Computation of Smallest Suffixient Sets#664334
- Generalized Symmetric Zernike Polynomials#251597
- Slovarʹ-spravochnik lingvisticheskikh terminov#470381
Record · ID 1052044
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