John L. Rhodes

From MaRDI portal
Person:1401333

Available identifiers

zbMath Open rhodes.john-lWikidataQ6254696 ScholiaQ6254696MaRDI QIDQ1401333

List of research outcomes

PublicationDate of PublicationType
Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples2023-05-05Paper
Mixing time for Markov chain on linear extensions2023-01-05Paper
Upper Bounds on Mixing Time of Finite Markov Chains2022-12-09Paper
On join irreducible \(J\)-trivial semigroups2022-07-20Paper
Holonomy theorem for finite semigroups2022-05-11Paper
Markov Chains Through Semigroup Graph Expansions (A Survey)2021-12-20Paper
Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure2021-09-09Paper
On the Dowling and Rhodes lattices and wreath products2021-04-20Paper
Truncated boolean representable simplicial complexes2020-10-14Paper
On the Wilson monoid of a pairwise balanced design2020-06-03Paper
Join irreducible semigroups2019-11-07Paper
Normal distributions of finite Markov chains2019-11-07Paper
Unified theory for finite Markov chains2019-03-28Paper
The lattice of flats of a boolean representable simplicial complex2019-01-18Paper
On the subsemigroup complex of an aperiodic Brandt semigroup2018-09-14Paper
On the atoms of algebraic lattices arising in 𝔮-theory2017-05-16Paper
On the topology of a boolean representable simplicial complex2017-04-03Paper
Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions2017-01-13Paper
Random walks on semaphore codes and delay de Bruijn semigroups2016-07-15Paper
The semaphore codes attached to a Turing machine via resets and their various limits2016-07-15Paper
A new notion of vertex independence and rank for finite graphs2015-04-21Paper
Boolean Representations of Simplicial Complexes and Matroids2015-02-11Paper
Superboolean rank and the size of the largest triangular submatrix of a random matrix2015-01-30Paper
FURTHER RESULTS ON MONOIDS ACTING ON TREES2012-10-10Paper
An effective lower bound for group complexity of finite semigroups and automata2012-04-26Paper
Representation theory of finite semigroups over semirings.2012-01-11Paper
BRET TILSON: HIS LIFE AND WORK2010-05-25Paper
A PROFINITE APPROACH TO STABLE PAIRS2010-05-25Paper
APERIODIC POINTLIKES AND BEYOND2010-05-25Paper
https://portal.mardi4nfdi.de/entity/Q33959362009-09-15Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q53027602009-01-13Paper
Turing machines and bimachines2008-06-24Paper
Closed subgroups of free profinite monoids are projective profinite groups2008-06-11Paper
COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY2006-10-16Paper
Krohn-Rhodes complexity pseudovarieties are not finitely based2005-06-07Paper
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.2003-08-17Paper
PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS2002-12-15Paper
POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q42639062000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q43757281998-03-02Paper
Subsemigroups and complexity via the presentation lemma1996-04-16Paper
https://portal.mardi4nfdi.de/entity/Q42712121994-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42712181994-01-19Paper
Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids1993-03-29Paper
ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I1993-02-08Paper
Undecidability of the identity problem for finite semigroups1992-09-27Paper
Reduction theorem for the type-II conjecture for finite monoids1990-01-01Paper
Semigroups whose idempotents form a subsemigroup1990-01-01Paper
The kernel of monoid morphisms1989-01-01Paper
Group theory via global semigroup theory1989-01-01Paper
Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37590451987-01-01Paper
Almost finite expansions of arbitrary semigroups1984-01-01Paper
A reduction theorem for complexity of finite semigroups1975-01-01Paper
Global structure theories for finite semigroups. Introduction. I: Extension of the fundamental theorem of finite semigroups. II: Axioms for complexity for all finite semigroups. III: Complexity of two-\(J\) class semigroups. IV: Synthesis of the classical and modern theory of finite semigroups1973-01-01Paper
Improved lower bounds for the complexity of finite semigroups1972-01-01Paper
Lower bounds for complexity of finite semigroups1971-01-01Paper
Complexity of finite semigroups1968-01-01Paper
Algebraic principles for the analysis of the biochemical system1967-01-01Paper
Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines1967-01-01Paper
Complexity of ideals in finite semigroups and finite-state machines1967-01-01Paper
Correction to “complexity of ideals in finite semigroups and finite-state machines”1967-01-01Paper
Nets of threshold elements1966-01-01Paper
Realizing complex boolean functions with simple groups1966-01-01Paper
RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINES1965-01-01Paper
A Property of Finite Simple Non-Abelian Groups1965-01-01Paper
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55121831963-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: John L. Rhodes