GAP (Semigroups) - References

Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Bib Ind
[Top of Book] [Contents] [Previous Chapter] [Next Chapter]

[MathJax off]

### References

[ABMS15] Araújo, J., Bentz, W., Mitchell, J. D. and Schneider, C., The rank of the semigroup of transformations stabilising a partition of a finite set, Math. Proc. Camb. Phil. Soc., 159 (2015), 339 - 353.

[AMM23] Anagnostopoulou-Merkouri, M., Mesyan, Z. and Mitchell, J. D., Properties of congruence lattices of graph inverse semigroups, International Journal of Algebra and Computation (2023).

[Aui12] Auinger, K., Krohn–Rhodes complexity of Brauer type semigroups, Portugaliae Mathematica, 69 (4) (2012), 341–360.

[BDF15] Brouwer, A. E., Draisma, J. and Frenk, B. J., Lossy Gossip and Composition of Metrics, Discrete & Computational Geometry, 53 (4) (2015), 890–913.

[BFCGOGJ92] Baccelli F. Cohen G. Olsder G. J., Q. J. P., Synchronisation and Linearity: An Algebra for Discrete Event Systems, Wiley (1992).

[Bur16] Burrell, S. A., The Order Problem for Natural and Tropical Matrix Semigroups, MMath project, University of St Andrews, United Kingdom (2016).

[CP77] Clifford, A. H. and Petrich, M., Some classes of completely regular semigroups, Journal of Algebra, 46 (2) (1977), 462--480.

[DMW18] Donoven, C., Mitchell, J. D. and Wilson, W. A., Computing maximal subsemigroups of a finite semigroup, Journal of Algebra, 505 (2018), 559-596.

[Eas19] East, J., Presentations for rook partition monoids and algebras and their singular ideals, J. Pure and Applied Algebra, 223 (2019), 1097-1122.

[EEMP19] East, J., Egri-Nagy, A., Mitchell, J. D. and Péresse, Y., Computing finite semigroups, J. Symbolic Computation, 92 (2019), 110 - 155.

[Far09] Farlow, K. G., Max-Plus Algebra, Master's thesis, Virginia Polytechnic Institute and State University, United States (2009).

[FL98] Fitzgerald, D. G. and Leech, J., Dual symmetric inverse monoids and representation theory, J. Austral. Math. Soc. A, 64 (1998), 345-67.

[FP97] Froidure, V. and Pin, J.-E., Algorithms for computing finite semigroups, in Foundations of computational mathematics (Rio de Janeiro, 1997), Springer, Berlin (1997), 112–126.

[Gau96] Gaubert, S., On the Burnside problem for Semigroups of Matrices over the (max, +) Algebra, Semigroup Forum, 5 (1996), 271-292.

[GGR68] Graham, N., Graham, R. and Rhodes, J., Maximal subsemigroups of finite semigroups, J. Combinatorial Theory, 4 (1968), 203–209.

[Gra68] Graham, R., On finite 0-simple semigroups and graph theory, Mathematical systems theory, 2 (4) (1968), 325–339.

[Gro06] Grood, C., The rook partition algebra, J. Combin. Theory Ser. A, 113 (2) (2006), 325–351.

[How95] Howie, J. M., Fundamentals of semigroup theory, The Clarendon Press Oxford University Press, London Mathematical Society Monographs. New Series, 12, New York (1995), x+351 pages
(Oxford Science Publications).

[HR05] Halverson, T. and Ram, A., Partition algebras, European Journal of Combinatorics, Elsevier, 26 (6) (2005), 869–921.

[JK07] Junttila, T. and Kaski, P. (Applegate, D., Brodal, G. S., Panario, D. and Sedgewick, R., Eds.), Engineering an efficient canonical labeling tool for large and sparse graphs, in Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, SIAM (2007), 135–149.

[KM11] Kudryavtseva, G. and Maltcev, V., Two generalisations of the symmetric inverse semigroups, Publ. Math. Debrecen, 78 (2) (2011), 253–282.

[KMU15] Kudryavtseva, G., Maltcev, V. and Umar, A., Presentation for the partial dual symmetric inverse monoid, Comm. Algebra, 43 (4) (2015), 1621–1639.

[MM13] Martin, P. and Mazorchuk, V., Partitioned binary relations, Mathematica Scandinavica, 113 (2013), 30-52.

[MM16] Mesyan, Z. and Mitchell, J. D., The structure of a graph inverse semigroup, Semigroup Forum, Springer Nature, 93 (1) (2016), 111–130.

[Pet70] Petrich, M., The translational hull in semigroups and rings, Semigroup Forum, 1 (1) (1970), 283--360.

[RR10] Radoszewski, J. and Rytter, W. (van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J. and Rumpe, B., Eds.), Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup, SOFSEM 2010: Theory and Practice of Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg (2010), 663--671.

[Sch92] Schein, B. M., The minimal degree of a finite inverse semigroup, Trans. Amer. Math. Soc., 333 (2) (1992), 877–888.

[Sim78] Simon, I., Limited Subsets of a Free Monoid, in Proceedings of the 19th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, SFCS '78, Washington, DC, USA (1978), 143–150.

[Wan19] Wang, Z.-P., Congruences on Graph Inverse Semigroups, Journal of Algebra, Elsevier {BV}, 534 (2019), 51--64.

[Top of Book] [Contents] [Previous Chapter] [Next Chapter]
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Bib Ind

generated by GAPDoc2HTML