Random ubiquitous transformation semigroups
From MaRDI portal
Publication:2009658
DOI10.1007/s00233-018-09992-7zbMath1467.20087arXiv1705.05709OpenAlexW2615856205MaRDI QIDQ2009658
Sascha Troscheit, Julius Jonušas
Publication date: 29 November 2019
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.05709
Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)
Uses Software
Cites Work
- Unnamed Item
- Dixon's theorem and random synchronization
- The minimal number of generators of a finite semigroup.
- On the ranks of certain semigroups of order-preserving transformations
- Computing finite semigroups
- On the Lambert \(w\) function
- On limited nondeterminism and the complexity of the V-C dimension
- Two variants of the Froidure-Pin algorithm for finite semigroups
- On the ranks of certain finite semigroups of transformations
- Algorithms for computing finite semigroups
- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
This page was built for publication: Random ubiquitous transformation semigroups