Benjamin Steinberg

activity

20062026

most citedAutomata over a binary alphabet generating free groups of even rank

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing math.GRShow all

3 papers · 1 filter

math.GR2026

A short proof of a bound on the size of finite irreducible semigroups of rational matrices

Benjamin Steinberg

I give a short proof of a recent result due to Kiefer and Ryzhikov showing that a finite irreducible semigroup of $n \times n$ matrices has cardinality at most $3^{n^{2}}$ .

math.GR2025

Realizing wedges of Moore spaces as classifying spaces of finite semigroups

Aris Martinian, Benjamin Steinberg

Fiedorowicz suggested that it was likely that every finite simply connected CW complex is homotopy equivalent to the classifying space of a finite semigroup. We prove that every fi…

math.GR2006★ 2 cited

Automata over a binary alphabet generating free groups of even rank

Benjamin Steinberg, Mariya Vorobets, Yaroslav Vorobets

We construct automata over a binary alphabet with $2 n$ states, $n \geq 2$ , whose states freely generate a free group of rank $2 n$ . Combined with previous work, this shows that a fre…