Abstract
In this paper we count the number of elements and idempotents in certainD-classes of the semigroup Bn of all binary relations on a set of n elements, namely whose those row and column rank do not exceed 3. This is an announcement of the results; detailed proofs of all results are contained in [2].
This is a preview of subscription content, log in via an institution to check access.
References
BIRKHOFF, G.:Lattice Theory, 3rd ed. Amer. Math. Soc., Providence, R. I., 1967.
BUTLER, K. K.-H.:On (0,1)-matrix semigroups, Dissertation, George Washington University, D. C. 1970.
BUTLER, K. K.-H.:Binary relations, presented at the First New York City Graph Theory Conference, June, 1970.
CLIFFORD, A. H. and G. B. PRESTON:The Algebraic Theory of Semigroups, vol. 1, Survey 7, Amer. Math. Soc., Providence, R.I., 1961.
KIM, J. B.:On structure of linear semigroups, to appear.
PLEMMONS, R. J. and M. T. WEST:On the semigroup of binary relations, to appear.
—:Idempotent binary relations, Technical report, University of Tenn., Knoxville, Tenn., 1970.
ZARETSKII, K. A.:The semigroup of binary relations, Math. Sbornik 61 (1963), 291–305 (Russian).
Author information
Authors and Affiliations
Additional information
Communicated by A. H. Clifford
The author presented the abstract of this paper in person at Tacoma, Washington, the 676 Meeting of the Amer. Math. Soc., June 20, 1970.
Rights and permissions
About this article
Cite this article
Butler, K.KH. On (0,1)-matrix semigroups. Semigroup Forum 3, 74–79 (1971). https://doi.org/10.1007/BF02572945
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02572945