中文
相关论文

相关论文: The M\"obius function of the composition poset

200 篇论文

We consider the zeta and M\"obius functions of a partial order on integer compositions first studied by Bergeron, Bousquet-M\'elou, and Dulucq. The M\"obius function of this poset was determined by Sagan and Vatter. We prove rationality of…

组合数学 · 数学 2007-05-23 Anders Björner , Bruce E. Sagan

We use discrete Morse theory to determine the M\"obius function of generalized factor order. Ordinary factor order on the Kleene closure A* of a set A is the partial order defined by letting u\leq w if w contains u as a subsequence of…

组合数学 · 数学 2011-08-22 Robert Willenbring

We study a poset of compositions restricted by part size under a partial ordering introduced by Bj\"{o}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…

组合数学 · 数学 2012-04-23 Adam M. Goyt

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

组合数学 · 数学 2012-02-14 Peter R. W. McNamara , Bruce E. Sagan

We use discrete Morse theory to provide another proof of Bernini, Ferrari, and Steingrimson's formula for the Mobius function of the consecutive pattern poset. In addition, we are able to determine the homotopy type of this poset. Earlier,…

组合数学 · 数学 2011-08-09 Bruce Sagan , Robert Willenbring

We generalize Bj\"{o}rner and Stanley's poset of compositions to $m$-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric…

组合数学 · 数学 2007-05-23 Brian Drake , T. Kyle Petersen

We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the M\"obius function and topology of such pattern posets.…

组合数学 · 数学 2018-06-08 Jason P. Smith

This paper analyzes the M\"obius ($\mu(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical M\"obius and…

数论 · 数学 2024-02-14 Rohan Pandey , Harry Richman

This is an introduction to the M\"obius function of a poset. The chief novelty is in the exposition. We show how order-preserving maps from one poset to another can be used to relate their M\"obius functions. We derive the basic results on…

组合数学 · 数学 2018-03-20 Chris Godsil

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

组合数学 · 数学 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

We study filters in the partition lattice formed by restricting to partitions by type. The M\"obius function is determined in terms of the easier-to-compute descent set statistics on permutations and the M\"obius function of filters in the…

组合数学 · 数学 2010-09-22 Richard Ehrenborg , Margaret Readdy

An occurrence of a consecutive permutation pattern $p$ in a permutation $\pi$ is a segment of consecutive letters of $\pi$ whose values appear in the same order of size as the letters in $p$. The set of all permutations forms a poset with…

组合数学 · 数学 2011-03-02 Antonio Bernini , Luca Ferrari , Einar Steingrimsson

The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…

组合数学 · 数学 2012-10-30 Emil Daniel Schwab , Juan Villarreal

In this paper we give a generalization of Chebyshev polynomials and using this we describe the M\"obius function of the generalized subword order from a poset {a1,...as,c |ai<c}, which contains an affirmative answer for the conjecture by…

组合数学 · 数学 2007-05-23 Masaya Tomie

Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.

组合数学 · 数学 2009-02-05 Colin Bailey , Joseph Oliveira

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

组合数学 · 数学 2014-04-03 Jason P Smith

This paper studies the M\"obius function and related questions about the finiteness of the poset of submodules of semisimple and general modules. We show how to calculate the M\"obius function for semisimple modules based on endomorphism…

环与代数 · 数学 2024-12-16 Dominik Krasula

We present a two term formula for the M\"obius function of intervals in the poset of all permutations, ordered by pattern containment. The first term in this formula is the number of so called normal occurrences of one permutation in…

组合数学 · 数学 2017-05-23 Jason P. Smith

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

组合数学 · 数学 2011-08-17 Gábor Hetyei , Christian Krattenthaler

In this paper, we will study the M\"obius polynomial, an invariant of ranked posets that arises in the study of splitting algebras. We will present a formula for the M\"obius polynomial of the direct product of posets in terms of the…

环与代数 · 数学 2014-10-17 Susan Durst
‹ 上一页 1 2 3 10 下一页 ›