Determinants and Möbius functions in trace monoids (Q1297486)

From MaRDI portal
Revision as of 20:33, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Determinants and Möbius functions in trace monoids
scientific article

    Statements

    Determinants and Möbius functions in trace monoids (English)
    0 references
    0 references
    0 references
    31 January 2000
    0 references
    Let \(\Sigma\) be a finite alphabet, let \(I\subset\Sigma\times\Sigma\) be a symmetric and irreflexive relation on \(\Sigma\), and let \(R\) be the smallest congruence that extends the set of equations \(\{ab=ba;\;(a,b)\in I\}\). The quotient \(\Sigma^*/R\) is called a trace monoid. The Möbius function of \(\Sigma^*/R\) is defined by (\(\varepsilon\) being the empty word) \[ \begin{cases}\mu(\varepsilon)=1\\ \mu(a_1\cdots a_n)=(-1)^n\quad &\text{if }a_i\in\Sigma,\text{ all the }a_i\text{'s are different and }\forall i,j\;i\neq j\Rightarrow(a_i,a_j)\in I\\ \mu(t)=0\quad &\text{otherwise}.\end{cases} \] The authors prove in particular that, if the independence relation of a trace monoid \(M\) admits a transitive orientation, then any unambigous lifting of the Möbius function of \(M\) is the determinant of a matrix defined by the smallest acceptor of the corresponding cross-section.
    0 references
    rational formal power series
    0 references
    finite alphabets
    0 references
    congruences
    0 references
    trace monoids
    0 references
    Möbius functions
    0 references
    determinants
    0 references

    Identifiers