António Malheiro
Universidade Nova de Lisboa
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by António Malheiro.
Journal of Algebra | 2015
Alan J. Cain; Robert D. Gray; António Malheiro
This paper shows that every Plactic algebra of finite rank admits a finite Grobner–Shirshov basis. The result is proved by using the combinatorial properties of Young tableaux to construct a finite complete rewriting system for the corresponding Plactic monoid, which also yields the corollaries that Plactic monoids of finite rank have finite derivation type and satisfy the homological finiteness properties left and right FP∞FP∞. Also, answering a question of Zelmanov, we apply this rewriting system and other techniques to show that Plactic monoids of finite rank are biautomatic.
Communications in Algebra | 2011
João Araújo; António Malheiro
We prove that given a finite (zero) exact right decomposition (M, T) of a semigroup S, if M is defined by a finite complete presentation, then S is also defined by a finite complete presentation. Exact right decompositions are natural generalizations to semigroups of coset decompositions in groups. As a consequence, we deduce that any Zappa–Szép extension of a monoid defined by a finite complete presentation, by a finite monoid, is also defined by such a presentation. It is also proved that a semigroup M 0[A; I, J; P], where A and P satisfy some very general conditions, is also defined by a finite complete presentation.
Theoretical Computer Science | 2006
António Malheiro
This paper introduces the topological finiteness condition finite derivation type (FDT) on the class of semigroups. This notion is naturally extended from the monoid case. With this new concept we are able to prove that if a Rees matrix semigroup M[S; I, J; P] has FDT then the semigroup S also has FDT. Given a monoid S and a finitely presented Rees matrix semigroup M[S; I, J; P] we prove that if the ideal of S generated by the entries of P has FDT, then so does M[S; I, J; P]. In particular, we show that, for a finitely presented completely simple semigroup M, the Rees matrix semigroup M = M[S; I, J; P] has FDT if and only if the group S has FDT.
International Journal of Algebra and Computation | 2015
Alan J. Cain; Robert D. Gray; António Malheiro
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Guzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij.
Journal of Algebra | 2014
João Araújo; Janusz Konieczny; António Malheiro
Abstract The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been several attempts to extend the notion of conjugacy to semigroups. In this paper, we present a new definition of conjugacy that can be applied to an arbitrary semigroup and it does not reduce to the universal relation in semigroups with a zero. We compare the new notion of conjugacy with existing definitions, characterize the conjugacy in various semigroups of transformations on a set, and count the number of conjugacy classes in these semigroups when the set is infinite.
Journal of Algebra | 2014
Robert D. Gray; António Malheiro
Abstract Given a monoid defined by a presentation, and a homotopy base for the derivation graph associated to the presentation, and given an arbitrary subgroup of the monoid, we give a homotopy base (and presentation) for the subgroup. If the monoid has finite derivation type (FDT), and if under the action of the monoid on its subsets by right multiplication the strong orbit of the subgroup is finite, then we obtain a finite homotopy base for the subgroup, and hence the subgroup has FDT. As an application we prove that a regular monoid with finitely many left and right ideals has FDT if and only if all of its maximal subgroups have FDT. We use this to show that a finitely presented regular monoid with finitely many left and right ideals satisfies the homological finiteness condition FP 3 if all of its maximal subgroups satisfy the condition FP 3 .
Information & Computation | 2011
Robert D. Gray; António Malheiro; Stephen J. Pride
We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions.
Journal of Algebraic Combinatorics | 2017
Alan J. Cain; António Malheiro
Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph for the q-analogue of the special linear Lie algebra
Information & Computation | 2017
Alan J. Cain; Robert D. Gray; António Malheiro
International Journal of Algebra and Computation | 2015
Alan J. Cain; António Malheiro
\mathfrak {sl}_{n}