Linus Richter

activity

20232026

most citedCo-analytic Counterexamples to Marstrand's Projection Theorem

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.FL2025

Languages of Words of Low Automatic Complexity Are Hard to Compute

Joey Chen, Bjørn Kjos-Hanssen, Ivan Koswara +2

The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). Fo…

math.LO2025

All Borel Group Extensions of Finite-Dimensional Real Space Are Trivial

Linus Richter

For $N \geq 2$ , we study the structure of definable abelian group extensions of the additive group $(R^{N}, +)$ by countable abelian (Borel) groups $G$ . Given an extension $H…