Difference between revisions of "ApCoCoA-1:NCo.AdMatrix"

From ApCoCoAWiki
m (replaced <quotes> tag by real quotes)
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
 +
{{Version|1}}
 
<command>
 
<command>
 
<title>NCo.AdMatrix</title>
 
<title>NCo.AdMatrix</title>
Line 12: Line 13:
 
<itemize>
 
<itemize>
 
<item>@param <em>X</em>: alphabet (or set of indeterminates) generating the free monoid <tt>K&lt;X&gt;</tt>. It is of STRING type.</item>
 
<item>@param <em>X</em>: alphabet (or set of indeterminates) generating the free monoid <tt>K&lt;X&gt;</tt>. It is of STRING type.</item>
<item>@param <em>M</em>: a LIST of words (or terms) in <tt>&lt;X&gt;</tt> which generates the monoid ideal <tt>&lt;M&gt;</tt>. Each word is represented as a STRING. For example, <tt>xy^2x</tt> is represented as <quotes>xyyx</quotes>, and the identity is represented as the empty string <quotes></quotes>.</item>
+
<item>@param <em>M</em>: a LIST of words (or terms) in <tt>&lt;X&gt;</tt> which generates the monoid ideal <tt>&lt;M&gt;</tt>. Each word is represented as a STRING. For example, <tt>xy^2x</tt> is represented as "xyyx", and the identity is represented as the empty string "".</item>
 
<item>@return: a LIST consisting of two elements. The first element in the LIST is a LIST of words that are the vertices in the Ufnarovski graph of M, and the second element is an adjacency matrix of the Ufnarovski graph.</item>
 
<item>@return: a LIST consisting of two elements. The first element in the LIST is a LIST of words that are the vertices in the Ufnarovski graph of M, and the second element is an adjacency matrix of the Ufnarovski graph.</item>
 
</itemize>
 
</itemize>
Line 41: Line 42:
 
</description>
 
</description>
 
<seealso>
 
<seealso>
<see>NCo.IsFinite</see>
+
<see>ApCoCoA-1:NCo.IsFinite|NCo.IsFinite</see>
<see>Introduction to CoCoAServer</see>
+
<see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see>
 
</seealso>
 
</seealso>
 
<types>
 
<types>
Line 53: Line 54:
 
<key>NCo.AdMatrix</key>
 
<key>NCo.AdMatrix</key>
 
<key>AdMatrix</key>
 
<key>AdMatrix</key>
<wiki-category>Package_gbmr</wiki-category>
+
<wiki-category>ApCoCoA-1:Package_gbmr</wiki-category>
 
</command>
 
</command>

Latest revision as of 13:36, 29 October 2020

This article is about a function from ApCoCoA-1.

NCo.AdMatrix

Construct an adjacency matrix of the Ufnarovski graph for a finite set of words.

Syntax

NCo.AdMatrix(X:STRING, M:LIST):LIST

Description

Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.

  • @param X: alphabet (or set of indeterminates) generating the free monoid K<X>. It is of STRING type.

  • @param M: a LIST of words (or terms) in <X> which generates the monoid ideal <M>. Each word is represented as a STRING. For example, xy^2x is represented as "xyyx", and the identity is represented as the empty string "".

  • @return: a LIST consisting of two elements. The first element in the LIST is a LIST of words that are the vertices in the Ufnarovski graph of M, and the second element is an adjacency matrix of the Ufnarovski graph.

Example

X:="xy";
M:=["xxx","yxy","xyx"];
NCo.AdMatrix(X, M);

[["xx", "xy", "yx", "yy"], Mat([
  [0, 1, 0, 0],
  [0, 0, 0, 1],
  [1, 0, 0, 0],
  [0, 0, 1, 1]
])]
-------------------------------
X:="xy";
M:=["xxx","yxy","xyx","yyx","yyy"];
NCo.AdMatrix(X, M);

[["xx", "xy", "yx", "yy"], Mat([
  [0, 1, 0, 0],
  [0, 0, 0, 1],
  [1, 0, 0, 0],
  [0, 0, 0, 0]
])]
-------------------------------

See also

NCo.IsFinite

Introduction to CoCoAServer