Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Andrew Hardt"'
An arborescence of a directed graph $\Gamma$ is a spanning tree directed toward a particular vertex $v$. The arborescences of a graph rooted at a particular vertex may be encoded as a polynomial $A_v(\Gamma)$ representing the sum of the weights of al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d318a7839b05dc0b97c2b4fdf4324436
This paper gives a general algorithm for computing the character table of any Renner monoid Hecke algebra, by adapting and generalizing techniques of Solomon used to study the rook monoid. The character table of the Hecke algebra of the rook monoid (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8478270ee9a2bae1d9fbce767ba0b2a