‣ IsFinitelyPresentedCategory( C ) | ( property ) |
Returns: true or false
The (evil) property of C being a finitely presented.
‣ DefiningTripleOfUnderlyingQuiver( C ) | ( attribute ) |
Returns: a pair
The defining triple of the quiver underlying the finitely presented category C.
‣ DataTablesOfCategory( C ) | ( attribute ) |
Returns: a pair of lists
The data tables of the category C.
‣ QuiverStringOfDigraph( D, name_of_quiver, prefix_of_name_of_morphisms ) | ( operation ) |
Returns: a string
Return a string encoding the underlying quiver of the digraph D. The string name_of_quiver will be the name of the underlying quiver. The string prefix_of_name_of_morphisms will be the prefix of the name all morphisms.
gap> LoadPackage( "FpCategories", false ); true gap> q := "q(1,2,3,4)[m_1_2:1->2,m_1_3:1->3,m_2_4:2->4,m_3_4:3->4]";; gap> F := PathCategory( FinQuiver( q ) ); PathCategory( FinQuiver( "q(1,2,3,4)[m_1_2:1-≻2,m_1_3:1-≻3,m_2_4:2-≻4,m_3_4:3-≻4]" ) ) gap> digraph := DigraphReflexiveTransitiveReduction( > Digraph( SetOfObjects( F ), IsHomSetInhabited ) ); <immutable digraph with 4 vertices, 4 edges> gap> QuiverStringOfDigraph( digraph, "q", "m" ) = q; true
‣ SetOfGeneratingMorphismsOfCategory( C ) | ( attribute ) |
Returns: a list of a CAP category morphisms
Return a list of generating morphisms of the finitely generated category C.
‣ SetOfGeneratingMorphisms( C ) | ( attribute ) |
Returns: a list of a CAP category morphisms
Return a list of generating morphisms of the finitely generated category C. The corresponding CAP operation is SetOfGeneratingMorphismsOfCategory.
generated by GAPDoc2HTML