Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-12-01T03:47:02.402Z Has data issue: false hasContentIssue false
  • English
  • Français

Idempotent rank in endomorphism monoids of finite independence algebras

Published online by Cambridge University Press:  14 July 2017

R. Gray
R. Gray*
Affiliation:
School of Mathematics, University of Leeds, Leeds LS2 9JT, UK ([email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

In 1992, Fountain and Lewin showed that any proper ideal of an endomorphism monoid of a finite independence algebra is generated by idempotents. Here the ranks and idempotent ranks of these ideals are determined. In particular, it is shown that when the algebra has dimension greater than or equal to three the idempotent rank equals the rank.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 137 , Issue 2 , 2007 , pp. 303 - 331
Copyright
Copyright © Royal Society of Edinburgh 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1 Bulman-Fleming, S.. Regularity and products of idempotents in endomorphism monoids of projective acts. Mathematika 42 (1995), 354–367.CrossRefGoogle Scholar
2 Cameron, P. and Szabó, C.. Independence algebras. J. Lond. Math. Soc. 61 (2000), 321–334.Google Scholar
3 Clifford, A. H. and Preston, G. B.. The algebraic theory of semigroups. II. Mathematical Surveys, vol. 7 (Providence, RI: American Mathematical Society, 1967).Google Scholar
4 Dawlings, R.. On idempotent affine mappings. Proc. R. Soc. Edinb. A 93 (1983), 345–348.CrossRefGoogle Scholar
5 Erdos, J. A.. On products of idempotent matrices. Glasgow Math. J. 8 (1967), 118–122.Google Scholar
6 Fountain, J. and Lewin, A.. Products of idempotent endomorphisms of an independence algebra of finite rank. Proc. Edinb. Math. Soc. 35 (1992), 493–500.CrossRefGoogle Scholar
7 Gomes, G. M. S. and Howie, J. M.. On the ranks of certain finite semigroups of transformations. Math. Proc. Comb. Phil. Soc. 101 (1987), 395–403.CrossRefGoogle Scholar
8 Gould, V.. Independence algebras. Alg. Unwers. 33 (1995), 294–318.CrossRefGoogle Scholar
9 Gray, R.. A graph theoretic approach to combinatorial problems in semigroup theory. PhD thesis, University of St Andrews (2005).Google Scholar
10 Gray, R.. Hall's condition and idempotent rank of ideals of endomorphism monoids. Proc. Edinb. Math. Soc. (In the press.)Google Scholar
11 Gray, R. and Ruškuc, N.. Generating sets of completely 0-símple semigroups. Commun. Alg. 33 (2005), 4657–4678.CrossRefGoogle Scholar
12 Green, J. A.. On the structure of semigroups. Ann. Math. 54 (1951), 163–172.CrossRefGoogle Scholar
13 Howie, J. M.. Fundamentals of semigroup theory. London Mathematical Society Monographs, vol. 7 (Academic, 1995).CrossRefGoogle Scholar
14 Howie, J. M. and McFadden, R. B.. Idempotent rank in finite full transformation semigroups. Proc. R. Soc. Edinb. A 114 (1990), 161–167.Google Scholar
15 Levi, I. and Seif, S.. Combinatorial techniques for determining rank and idempotent rank of certain finite semigroups. Proc. Edinb. Math. Soc. 45 (2002), 617–630.CrossRefGoogle Scholar
16 Levi, I. and Seif, S.. Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups. J. Alg. 266 (2003), 189–219.CrossRefGoogle Scholar
17 Levi, I. and Seif, S.. Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups. J. Alg. 266 (2003), 220–238.CrossRefGoogle Scholar
18 McKenzie, R. N., McNulty, G. F. and Taylor, W. F.. Algebras, lattices, varieties. I. Wadsworth and Brooks/Cole Mathematics Series (Monterey, CA: Wadsworth, 1987).Google Scholar
19 Ruškuc, N.. On the rank of completely 0-simple semigroups. Math. Proc. Camb. Phil. Soc. 116 (1994), 325–338.CrossRefGoogle Scholar