The Möbius function of separable and decomposable permutations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100396" target="_blank" >RIV/00216208:11320/11:10100396 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jcta.2011.06.002" target="_blank" >http://dx.doi.org/10.1016/j.jcta.2011.06.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcta.2011.06.002" target="_blank" >10.1016/j.jcta.2011.06.002</a>
Alternative languages
Result language
angličtina
Original language name
The Möbius function of separable and decomposable permutations
Original language description
We give a recursive formula for the Möbius function of an interval [p,q] in the poset of permutations ordered by pattern containment in the case where q is a decomposable permutation, that is, consists of two blocks where the first one contains all the letters 1,2,...,k for some k.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory - Series A
ISSN
0097-3165
e-ISSN
—
Volume of the periodical
118
Issue of the periodical within the volume
8
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
2346-2364
UT code for WoS article
000294983300010
EID of the result in the Scopus database
—