Pith. sign in

REVIEW 1 cited by

On the length of the shortest non-trivial element in the derived and the lower central series

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1311.0138 v1 pith:HHP7AFC3 submitted 2013-11-01 math.GR

Abdelrhman Elkasapy , Andreas Thom This is my paper · ORCID
classification math.GR
keywords lowerseriescentralderivedelementlengthnon-trivialshortest
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent residual finiteness growth and on almost laws for compact groups.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Solovay-Kitaev theorem for quantum signal processing

    quant-ph 2025-05 reject novelty 7.0 of 10

    A lifted Solovay-Kitaev argument proves that density of QSP ansätze in function spaces implies the existence of short approximating circuits, with examples for several QSP variants.

Pith tools