The Open UniversitySkip to content
 

The Möbius function of permutations with an indecomposable lower bound

Brignall, Robert and Marchant, David William (2018). The Möbius function of permutations with an indecomposable lower bound. Discrete Mathematics, 341(5) pp. 1380–1391.

Full text available as:
[img]
Preview
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (514kB) | Preview
DOI (Digital Object Identifier) Link: https://doi.org/10.1016/j.disc.2018.02.012
Google Scholar: Look up in Google Scholar

Abstract

We show that the Möbius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this can simplify the calculation of the Möbius sum. For increasing oscillations, we give a recursion for the Möbius sum which only involves evaluating simple inequalities.

Item Type: Journal Item
Copyright Holders: 2018 Elsevier
ISSN: 0012-365X
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 53957
Depositing User: Robert Brignall
Date Deposited: 22 Mar 2018 16:38
Last Modified: 02 May 2019 07:53
URI: http://oro.open.ac.uk/id/eprint/53957
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU