arXiv 0806.15002008-06math.CO

The Möbius Function of a Restricted Composition Poset

Adam M. Goyt

备注：: 16 pages, 3 figures, minor edits, to appear in Ars Combinatoria

英文摘要：

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 $C_{d+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 $C_{d+1}$. We use counting arguments and shellability as avenues for proving that the Möbius function is $μ(u,w)=(-1)^{|u|+|w|}{w\choose u}_{dn}$, where ${w\choose 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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the Möbius function of the locally finite poset associated with a numerical semigroup

Let $S$ be a numerical semigroup and let $\left(\mathbb{Z},\leqslant\_S\right)$ be the (locally finite) poset induced by $S$ on the set of integers $\mathbb{Z}$ defined by $x \leqslant\_S y$ if and only if $y-x\in S$ for all integers $x$ and $y$. In this paper, we investigate the M{ö}bius function associated to $\left(\mathbb{Z},\leqslant\_S\right)$ when $S$ is an arithmetic semigroup.

2016-03-31math.CO

Möbius function of semigroup posets through Hilbert series

In this paper, we investigate the M{ö}bius function $μ\_{\mathcal{S}}$ associated to a (locally finite) poset arising from a semigroup $\mathcal{S}$ of $\mathbb{Z}^m$. We introduce and develop a new approach to study $μ\_{\mathcal{S}}$ by using the Hilbert series of $\mathcal{S}$. The latter enables us to provide formulas for $μ\_{\mathcal{S}}$ when $\mathcal{S}$ belongs to certain families of semigroups. Finally, a characterization for a locally finite poset to be isomorphic to a semigroup poset is given.

2016-03-31math.COmath.GRmath.NT

Counting linear extensions of restricted posets

The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for posets of height two is #P-complete. Furthermore, we prove that this holds for incidence posets of graphs. Finally, we prove that the number of linear extensions for posets of dimension two is #P-complete.

2018-02-17math.CO

The topology of restricted partition posets

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with descent composition $\vec{c}$. Furthermore, the action of the symmetric group on the top homology is isomorphic to the Specht module $S^{B}$ where $B$ is a border strip associated to the composition. We also study the filter of pointed set partitions generated by a knapsack integer partition and show the analogous results on homotopy type and action on the top homol…

2013-12-06math.CO

Combinatorial statistics on restricted growth functions containing a pattern exactly $k$ times

In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are of interest because they are in bijection with set partitions. We examine the case when a restricted growth function contains a pattern exactly $k$ times, where $k=0$ corresponds to pattern avoidance. We prove results for several statistic and pattern combinations in the case when $k=1$ and define a new type of Wilf equivalence for these patterns. We also examine a poset related to $M(n)$, the poset of integer partiti…

2020-03-11math.CO

限制于 Weyl 锥的 Shi arrangement

Shi arrangements restricted to Weyl cones

研究 Shi arrangement 限制于 Weyl 锥的情形，通过提供区域、flat 与反链间的双射加细 parking function 数，并将相关 Poincaré 多项式解释为三个同构分次环的 Hilbert 级数。

2025-10-10math.CO

更多相关论文收起更多论文

Counting chambers in restricted Coxeter arrangements

Solomon showed that the Poincaré polynomial of a Coxeter group $W$ satisfies a product decomposition depending on the exponents of $W$. This polynomial coincides with the rank-generating function of the poset of regions of the underlying Coxeter arrangement. In this note we determine all instances when the analogous factorization property of the rank-generating function of the poset of regions holds for a restriction of a Coxeter arrangement. It turns out that this is always the case with the exception of some instances in type $E_8$.

2017-06-29math.COmath.GR

Stable Matchings with Restricted Preferences: Structure and Complexity

It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset $P$, an instance $I(P)$ can be constructed efficiently so that the rotation poset of $I(P)$ is isomorphic to $P$. In this case, we say that $I(P)$ realizes $P$. Many researchers exploit the rotation poset of an instance to develop fast algorithms or to establish the hardness of stable matching problems. In order to gain a parameterized understanding of the …

2021-01-28cs.CCcs.DMcs.GT

Enumerating (2+2)-free posets by indistinguishable elements

A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the same strict down-set. Being indistinguishable defines an equivalence relation on the elements of the poset. We introduce the statistic maxindist, the maximum size of a set of indistinguishable elements. We show that, under a bijection of Bousquet-Melou et al., indistinguishable elements correspond to letters that belong to the same run in the so-called ascent s…

2011-04-05math.CO

The Tchebyshev transforms of the first and second kind

We give an in-depth study of the Tchebyshev transforms of the first and second kind of a poset, recently discovered by Hetyei. The Tchebyshev transform (of the first kind) preserves desirable combinatorial properties, including Eulerianess (due to Hetyei) and EL-shellability. It is also a linear transformation on flag vectors. When restricted to Eulerian posets, it corresponds to the Billera, Ehrenborg and Readdy omega map of oriented matroids. One consequence is that nonnegativity of the cd-index is maintained. The Tchebyshev transform of the second kind is a Hopf algebra endomorphism on the …

2004-12-06math.CO

Lexicographic shellability of the Bruhat-Chevalley order on fixed-point-free involutions

The main purpose of this paper is to prove that the Bruhat-Chevalley ordering of the symmetric group when restricted to the fixed-point-free involutions forms an $EL$-shellable poset whose order complex triangulates a ball. Another purpose of this article is to prove that the Deodhar-Srinivasan poset is a proper, graded subposet of the Bruhat-Chevalley poset on fixed-point-free involutions.

2014-05-05math.AGmath.ATmath.CO

$E_6$ 限制超平面排列及其 $E_7$ 影子：在微小子布鲁哈特偏序集上的外尔输运

The $E_6$ Restricted Hyperplane Arrangement and its $E_7$ Shadow: Weyl Transport on a Minuscule Bruhat Poset

Hamilton College（汉密尔顿学院）；Northeastern University（东北大学）

本研究通过 $E_7$ 的微小子表示输运，刻画了 $E_6$ 的 $27$ 维权诱导的限制超平面排列，确定了其腔室、极射线及完整壁架构，并揭示了表示论与三次曲面几何的深层联系。

2026-09-11hep-thmath.AGmath.CO

有序集合划分格子

Ordered set partition posets

Michigan State University（密歇根州立大学）；University of Minnesota（明尼苏达大学）

本文研究了有序集合划分格子的子格结构，探讨了块大小受限的拓扑和组合性质，推导了递归原子顺序及对称群作用的公式，并揭示了与k-Catalan数相关的区间结构。

2026-06-04math.ATmath.COmath.GN

Some enumerative results related to ascent sequences

An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. In this paper, we prove in the affirmative some recent conjectures concerning pattern avoidance for ascent sequences. Given a pattern $τ$, let $\mathcal{S}_τ(n)$ denote the set of ascent sequences of length $n$ avoiding $τ$. Here, we show that the joint distribution of the statistic pair $(\asc,\zero)$ on $\m…

2012-07-16math.CO