Home > Search Results: keywords:"Möbius function|permutation"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
The Möbius function of combinatorial posets
 Kopfová, Lenka ; Jelínek, Vít (advisor) ; Kantor, Ida (referee)
In this thesis we study the poset of signed permutations under the pattern containment order. A signed permutation is a permutation in which each entry has a plus or a minus sign assigned to it. Therefore signed permutations are a generalization of unsigned permutations as those correspond to picking the plus sign for each entry. We present several results regarding the M¨obius function of signed permutations, some of which are generalizations of those for unsigned ones. Moreover, we study the poset isomorphism between intervals of the poset of signed permutations, which ensures that two intervals have the same value of the M¨obius function.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English