Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Igor Dolinka"'
Autor:
Igor Dolinka, Robert D. Gray
Publikováno v:
Forum of Mathematics, Sigma, Vol 11 (2023)
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for certain one
Externí odkaz:
https://doaj.org/article/ff6a1ad22d914d67b46c01e5b4564e87
Autor:
Igor Dolinka
Publikováno v:
Israel Journal of Mathematics. 245:347-387
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered sets. We pro
Publikováno v:
Journal of Pure and Applied Algebra. 223(12):5106-5146
For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product $M\wr T_n$
Autor:
Igor Dolinka, Rob Gray
In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership problem fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d576ec4c48a6c448feecb4dec1376e4
https://ueaeprints.uea.ac.uk/id/eprint/77601/
https://ueaeprints.uea.ac.uk/id/eprint/77601/
Autor:
Igor Dolinka
Publikováno v:
Semigroup Forum. 97:115-130
We prove that every finite idempotent semigroup (band) is finitely related, which means that the clone of its term operations (i.e. operations induced by words) is determined by finitely many relations. This solves an open problem posed by Peter Mayr
Autor:
James East, Igor Dolinka
Publikováno v:
Semigroup Forum. 96:253-300
Let $\mathcal M_{mn}=\mathcal M_{mn}(\mathbb F)$ denote the set of all $m\times n$ matrices over a field $\mathbb F$, and fix some $n\times m$ matrix $A\in\mathcal M_{nm}$. An associative operation $\star$ may be defined on $\mathcal M_{mn}$ by $X\st
Publikováno v:
Proceedings of the London Mathematical Society. 114:401-432
The category of all idempotent generated semigroups with a prescribed structure E of their idempotents E (called the biordered set) has an initial object called the free idempotent generated semigroup over E, defined by a presentation over alphabet E
Autor:
James East, Igor Dolinka
Publikováno v:
Glasgow Mathematical Journal. 59(3):673-683
We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent generatin
Autor:
D. G. FitzGerald, Igor Dolinka, Nicholas Ham, James Hyde, Athanasios Evangelou, Nicholas Loughlin, James East, James D. Mitchell
We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms of certain vertex- and edge-coloured graphs associated to Motzkin dia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf43ce1781750ab2487d9454b35ee9a1
https://hdl.handle.net/10023/19003
https://hdl.handle.net/10023/19003
This paper concerns a number of diagram categories, namely the partition, planar partition, Brauer, partial Brauer, Motzkin and Temperley-Lieb categories. If $\mathcal K$ denotes any of these categories, and if $\sigma\in\mathcal K_{nm}$ is a fixed m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00d2c99c0981bb6d3c294bc2c62bab75