Alan J. Cain

From MaRDI portal
Person:306543

Available identifiers

zbMath Open cain.alan-jDBLP26/3553WikidataQ92982858 ScholiaQ92982858MaRDI QIDQ306543

List of research outcomes





PublicationDate of PublicationType
Commutative nilpotent transformation semigroups2024-08-22Paper
Identities and bases in the Sylvester and Baxter monoids2024-01-08Paper
Commutative nilpotent transformation semigroups2023-10-12Paper
Structure of quasi-crystal graphs and applications to the combinatorics of quasi-symmetric functions2023-09-26Paper
A local characterization of quasi-crystal graphs2023-09-26Paper
Every numerical semigroup arises as an automaton monoid2023-03-22Paper
Quasi-crystals for arbitrary root systems and associated generalizations of the hypoplactic monoid2022-12-31Paper
Representations and identities of plactic-like monoids2022-06-13Paper
Identities and bases in the hypoplactic monoid2022-02-04Paper
Reconstructing Young tableaux2022-01-20Paper
Representations and identities of plactic-like monoids2021-07-09Paper
A language hierarchy of binary relations2020-12-15Paper
Two applications of monoid actions to cross-sections2020-04-22Paper
Visual thinking and simplicity of proof2019-12-05Paper
Context-free word problem semigroups2019-10-15Paper
Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, Baxter, and related monoids2019-07-31Paper
Combinatorics of patience sorting monoids2019-07-18Paper
The monoids of the patience sorting algorithm2019-03-27Paper
Context-free word problem semigroups2019-03-25Paper
Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)2018-12-19Paper
Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids2018-09-07Paper
Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences2018-03-21Paper
Conjugacy in Patience Sorting monoids2018-03-01Paper
Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, and related monoids2017-11-15Paper
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids2017-08-08Paper
Automaton semigroups: new constructions results and examples of non-automaton semigroups2017-05-12Paper
A note on identities in plactic monoids and monoids of upper-triangular tropical matrices2017-05-12Paper
GROWTHS OF ENDOMORPHISMS OF FINITELY GENERATED SEMIGROUPS2017-05-11Paper
Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson-Schensted-Knuth-type correspondence for quasi-ribbon tableaux2017-03-23Paper
A countable family of finitely presented infinite congruence-free monoids2016-11-25Paper
Decision problems for word-hyperbolic semigroups2016-08-31Paper
Automaton semigroup constructions.2015-10-12Paper
Deciding conjugacy in sylvester monoids and other homogeneous monoids2015-09-11Paper
A simple non-bisimple congruence-free finitely presented monoid.2015-06-04Paper
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids2015-04-21Paper
Hopfian and co-Hopfian subsemigroups and extensions.2015-01-26Paper
Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.2014-12-05Paper
Subalgebras of FA-presentable algebras.2014-10-31Paper
Markov semigroups, monoids and groups.2014-10-15Paper
Finitely presented monoids with linear Dehn function need not have regular cross-sections.2014-06-30Paper
Automatic structures for subsemigroups of Baumslag-Solitar semigroups.2014-04-25Paper
Hyperbolicity of monoids presented by confluent monadic rewriting systems.2013-11-01Paper
For a few elements more: A survey of finite Rees index2013-07-31Paper
Automatic semigroups and Bruck-Reilly extensions.2013-04-05Paper
Green index in semigroups: generators, presentations, and automatic structures.2013-03-04Paper
Unary FA-presentable binary relations: transitivity and classification results2013-03-01Paper
Monoids $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}a^{\varepsilon}b^{\varphi}=b\rangle$ admit finite complete rewriting systems2013-02-12Paper
Monoids $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}=b\rangle$ admit finite complete rewriting systems2013-02-05Paper
CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS2013-01-17Paper
UNARY FA-PRESENTABLE SEMIGROUPS2012-10-10Paper
Deus ex machina and the aesthetics of proof2010-11-29Paper
Automatic presentations and semigroup constructions2010-10-06Paper
Automatic presentations for semigroups.2009-11-27Paper
MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS2009-11-09Paper
DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS2009-11-09Paper
Automaton semigroups2009-11-06Paper
Malcev presentations for subsemigroups of direct products of coherent groups.2009-03-30Paper
Automatic Presentations for Cancellative Semigroups2008-11-20Paper
CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS2008-06-25Paper
Malcev presentation for subsemigroups of groups -- a survey.2007-05-18Paper
CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS2007-03-20Paper
A GROUP-EMBEDDABLE NON-AUTOMATIC SEMIGROUP WHOSE UNIVERSAL GROUP IS AUTOMATIC2006-09-25Paper
Subsemigroups of virtually free groups: finite Malcev presentations and testing for freeness2006-08-10Paper
Subsemigroups of groups: presentations, Malcev presentations, and automatic structures2006-07-25Paper

Research outcomes over time

This page was built for person: Alan J. Cain