Metraipolis › archive › dc_5becb5350ada

Two problems about bases and independent sets in free groups — arXiv:2609.00382

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00382
License (as archived)
CC0-1.0
Archived
2026-10-17T07:06:26.978Z
SHA-256 of the archived text
f29d4fcad7e56e9954356252ec495c8fa501d7680a4637206a8866c999380256
Stable URL of this page
https://metraipolis.com/documento/dc_5becb5350ada

How to cite

Two problems about bases and independent sets in free groups — arXiv:2609.00382 — arXiv (en), https://arxiv.org/abs/2609.00382 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5becb5350ada (Metraipolis archive dc_5becb5350ada, sha256 f29d4fcad7e56e9954356252ec495c8fa501d7680a4637206a8866c999380256)
BibTeX
@misc{dc5becb5350ada,
  title = {Two problems about bases and independent sets in free groups — arXiv:2609.00382},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00382},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5becb5350ada; sha256 f29d4fcad7e56e9954356252ec495c8fa501d7680a4637206a8866c999380256},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00382. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.CO).
Categorie arXiv: Group Theory (math.GR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.00382 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:52:59.707Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).