SSL chapBib.html Interaktion und
PortierbarkeitHTML

products/Sources/formale Sprachen/GAP/pkg/semigroups/doc/chapBib.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (Semigroups) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chap10.html">10</a> <a href="chap11.html">11</a> <a href="chap12.html">12</a> <a href="chap13.html">13</a> <a href="chap14.html">14</a> <a href="chap15.html">15</a> <a href="chap16.html">16</a> <a href="chap17.html">17</a> <a href="chap18.html">18</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap18.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div>

<a href="chapBib_mj.html">[MathJax on]</a>
<a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a>

<h3>References</h3>

<a id="biBAraujo2015aa" name="biBAraujo2015aa"></a>

[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.


<a id="biBAnagnostopoulou-Merkouri2021aa" name="biBAnagnostopoulou-Merkouri2021aa"></a>

[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).


<a id="biBauinger2012krohn" name="biBauinger2012krohn"></a>

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


<a id="biBBrouwer2015aa" name="biBBrouwer2015aa"></a>

[BDF15] Brouwer, A. E., Draisma, J. and Frenk, B. J.,
<a href="https://dx.doi.org/10.1007/s00454-015-9666-1">Lossy Gossip and Composition of Metrics</a>,
Discrete & Computational Geometry,
53 (4)
(2015),
890–913.


<a id="biBBacelli1992aa" name="biBBacelli1992aa"></a>

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


<a id="biBBurrell2016aa" name="biBBurrell2016aa"></a>

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


<a id="biBClifford1977aa" name="biBClifford1977aa"></a>

[CP77] Clifford, A. H. and Petrich, M.,
<a href="http://dx.doi.org/10.1016/0021-8693(77)90383-0">Some classes of completely regular semigroups</a>,
Journal of Algebra,
46 (2)
(1977),
462--480.


<a id="biBDonoven2018aa" name="biBDonoven2018aa"></a>

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


<a id="biBEast2019aa" name="biBEast2019aa"></a>

[Eas19] East, J.,
<a href="https://www.sciencedirect.com/science/article/pii/S0022404918301403">Presentations for rook partition monoids and algebras and their
 singular ideals</a>,
J. Pure and Applied Algebra,
223
(2019),
1097-1122.


<a id="biBMitchell2019aa" name="biBMitchell2019aa"></a>

[EEMP19] East, J., Egri-Nagy, A., Mitchell, J. D. and Péresse, Y.,
<a href="https://www.sciencedirect.com/science/article/pii/S0747717118300087">Computing finite semigroups</a>,
J. Symbolic Computation,
92
(2019),
110 - 155.


<a id="biBKacie2009aa" name="biBKacie2009aa"></a>

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


<a id="biBFitzgerald1998aa" name="biBFitzgerald1998aa"></a>

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


<a id="biBFroidure1997aa" name="biBFroidure1997aa"></a>

[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.


<a id="biBGaubert1996aa" name="biBGaubert1996aa"></a>

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


<a id="biBGraham1968aa" name="biBGraham1968aa"></a>

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


<a id="biBGraham1968Graph" name="biBGraham1968Graph"></a>

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


<a id="biBGrood2006aa" name="biBGrood2006aa"></a>

[Gro06] Grood, C.,
<a href="https://dx.doi.org/10.1016/j.jcta.2005.03.006">The rook partition algebra</a>,
J. Combin. Theory Ser. A,
113 (2)
(2006),
325–351.


<a id="biBHowie1995aa" name="biBHowie1995aa"></a>

[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).


<a id="biBHalverson2005PartitionAlgebras" name="biBHalverson2005PartitionAlgebras"></a>

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


<a id="biBJunttilaKaski" name="biBJunttilaKaski"></a>

[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.


<a id="biBKudryavtseva2011aa" name="biBKudryavtseva2011aa"></a>

[KM11] Kudryavtseva, G. and Maltcev, V.,
<a href="https://dx.doi.org/10.5486/PMD.2011.4375">Two generalisations of the symmetric inverse semigroups</a>,
Publ. Math. Debrecen,
78 (2)
(2011),
253–282.


<a id="biBKudryavtseva2015aa" name="biBKudryavtseva2015aa"></a>

[KMU15] Kudryavtseva, G., Maltcev, V. and Umar, A.,
<a href="https://dx.doi.org/10.1080/00927872.2013.876031">Presentation for the partial dual symmetric inverse monoid</a>,
Comm. Algebra,
43 (4)
(2015),
1621–1639.


<a id="biBMartin2011aa" name="biBMartin2011aa"></a>

[MM13] Martin, P. and Mazorchuk, V.,
<a href="https://www.mscand.dk/article/view/15480">Partitioned binary relations</a>,
Mathematica Scandinavica,
113
(2013),
30-52.


<a id="biBMesyan2016" name="biBMesyan2016"></a>

[MM16] Mesyan, Z. and Mitchell, J. D.,
<a href="https://doi.org/10.1007/s00233-016-9793-x">The structure of a graph inverse semigroup</a>,
Semigroup Forum,
Springer Nature,
93 (1)
(2016),
111–130.


<a id="biBPetrich1970aa" name="biBPetrich1970aa"></a>

[Pet70] Petrich, M.,
<a href="https://doi.org/10.1007/BF02573051">The translational hull in semigroups and rings</a>,
Semigroup Forum,
1 (1)
(1970),
283--360.


<a id="biBRadoszewski2010aa" name="biBRadoszewski2010aa"></a>

[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.


<a id="biBSchein1992aa" name="biBSchein1992aa"></a>

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


<a id="biBSimon1978aa" name="biBSimon1978aa"></a>

[Sim78] Simon, I.,
<a href="https://dx.doi.org/10.1109/SFCS.1978.21">Limited Subsets of a Free Monoid</a>,
 in Proceedings of the 19th Annual Symposium on Foundations of
 Computer Science,
IEEE Computer Society,
SFCS '78,
Washington, DC, USA
(1978),
143–150.


<a id="biBWang2019aa" name="biBWang2019aa"></a>

[Wan19] Wang, Z.-P.,
<a href="https://doi.org/10.1016/j.jalgebra.2019.06.020">Congruences on Graph Inverse Semigroups</a>,
Journal of Algebra,
Elsevier {BV},
534
(2019),
51--64.


 

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap18.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chap10.html">10</a> <a href="chap11.html">11</a> <a href="chap12.html">12</a> <a href="chap13.html">13</a> <a href="chap14.html">14</a> <a href="chap15.html">15</a> <a href="chap16.html">16</a> <a href="chap17.html">17</a> <a href="chap18.html">18</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality100%

¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.26Angebot Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können ¤

*Eine klare Vorstellung vom Zielzustand

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.

SSL chapBib.html Interaktion und PortierbarkeitHTML

¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.26Angebot Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können ¤

Haftungshinweis

Bemerkung:

SSL chapBib.html Interaktion und
PortierbarkeitHTML