关于偏序集上莫比乌斯反演的不确定性原理

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.

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.

Fast Möbius inversion in semimodular lattices and U-labelable posets

We consider the problem of fast zeta and Möbius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and Möbius transforms can be computed in $O(e)$ elementary arithmetic operations, where $e$ denotes the size of the covering relation. We show that this family is exactly that of geometric lattices. We also extend the algorithms so that they work in $e$ operations for all semimodular lattices, including chains and divisor lattices. Finally, for both transforms, we provide a more general algorithm that works in $e$ operat…

关于Fibonacci蛛网偏序集的Mobiusien函数和Mobiusien反演公式的注记

A note on mobiusien function and mobiusien inversion formula of fibonacci cobweb poset

利用平面格点坐标系中Fibonacci蛛网偏序集P的定义，首次给出了P的Mobiusien函数的显式表达式。

Counting linear extensions of posets with determinants of hook lengths

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also give $q$-analogues of this determinantal formula in terms of the major index and inversion statistics. As applications, we give families of tree posets whose numbers of linear extensions are given by generalizations of Euler numbers, we draw relations to Naruse-Okada's positive formulas for the number of linear extensions of skew $d$-complete posets, and we g…

Proof of a conjectured Möbius inversion formula for Grothendieck polynomials

Schubert polynomials $\mathfrak{S}_w$ are polynomial representatives for cohomology classes of Schubert varieties in a complete flag variety, while Grothendieck polynomials $\mathfrak{G}_w$ are analogous representatives for the $K$-theory classes of the structure sheaves of Schubert varieties. In the special case that $\mathfrak{S}_w$ is a multiplicity-free sum of monomials, K. Mészáros, L. Setiabrata, and A. St. Dizier conjectured that $\mathfrak{G}_w$ can be easily computed from $\mathfrak{S}_w$ via Möbius inversion on a certain poset. We prove this conjecture.