The Mobius Function of a Restricted Composition Poset
نویسنده
چکیده
We study a poset of compositions restricted by part size under a partial ordering introduced by Björner and Stanley. We show that our composition poset Cd+1 is isomorphic to the poset of words A ∗ d. This allows us to use techniques developed by Björner to study the Möbius function of Cd+1. We use counting arguments and shellability as avenues for proving that the Möbius function is μ(u,w) = (−1)|u|+|w| ( w u ) dn , where ( w u ) dn is the number of d-normal embeddings of u in w. We then prove that the formal power series whose coefficients are given by the zeta and the Möbius functions are both rational. Following in the footsteps of Björner and Reutenauer and Björner and Sagan, we rely on definitions to prove rationality in one case, and in another case we use finite-state automata.
منابع مشابه
On the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملThe Möbius function of a composition poset
We determine the Möbius function of a poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. This composition poset turns out to be intimately connected with subword order, whose Möbius function was determined by Björner. We show that using a generalization of subword order, we can obtain both Björner’s r...
متن کاملA generalization of Chebyshev polynomials and non rooted posets
Bjorner was the first to determine the Mobius functions of factor orders and subword orders. To determine the Mobius functions, he used involutions, shellability, and generating functions. [2][3][4] Bjorner and Stanley found an interesting relation among the subword order derived from a two point set {a, b} , symmetric groups and composition orders. [6] Factor orders, subword orders, and genera...
متن کاملOn the poset of partitions of an integer
We study the posets (partially ordered sets) P, of partitions of an integer n, ordered by refinement, as defined by G. Birkhoff, “Lattice Theory” (3rd ed.) Colloq. Pub]. Vol. 25, 1967, Amer. Math. Sot. Providence. R.I. In particular we disprove the conjecture that the posets P,, are Cohen-Macaulay for all n. and show that even the Mobius function on the intervals does not alternate in sign in g...
متن کاملSaturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 126 شماره
صفحات -
تاریخ انتشار 2016