The Möbius function of separable permutations (extended abstract)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10051744" target="_blank" >RIV/00216208:11320/10:10051744 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Möbius function of separable permutations (extended abstract)
Original language description
A permutation is separable if it avoids the patterns 2413 and 3142. We give a computationally efficient formula for the Möbius function of an interval (q,p) in the poset of separable permutations ordered by pattern containment. A consequence of the formula is that the Möbius function of such an interval (q,p) is bounded by the number of occurrences of q as a pattern in p. The formula also implies that for any separable permutation p the Möbius function of (1,p) is either 0, 1 or -1.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Article name in the collection
22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
ISBN
—
ISSN
1365-8050
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Neuveden
Place of publication
Neuveden
Event location
San Francisco, USA
Event date
Aug 2, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—