1996
DOI: 10.1006/eujc.1996.0062
|View full text |Cite
|
Sign up to set email alerts
|

The r-cubical Lattice and a Generalization of the cd-index

Abstract: In this paper we generalize the cd -index of the cubical lattice to an r -cd -index , which we denote by Õ ( r ) . The coef ficients of Õ ( r ) enumerate augmented Andre ´ r -signed permutations , a generalization of Purtill's work relating the cd -index of the cubical lattice and signed Andre ´ permutations . As an application we use the r -cd -index to determine that the extremal configuration which maximizes the Mo ¨ bius function of arbitrary rank selections , where all the r i 's are greater than one , is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
40
0
1

Year Published

1997
1997
2011
2011

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 27 publications
(42 citation statements)
references
References 13 publications
1
40
0
1
Order By: Relevance
“…For a maximal chain c = {0 From this result we obtain the following corollary, which was observed in [15]. An EL-labeling of a graded poset P is an R-labeling such that in each interval [x, y] the unique rising chain is lexicographically least among all chains in the interval [x, y].…”
Section: Techniques For Computing the Ab-and Cd-indexesmentioning
confidence: 62%
“…For a maximal chain c = {0 From this result we obtain the following corollary, which was observed in [15]. An EL-labeling of a graded poset P is an R-labeling such that in each interval [x, y] the unique rising chain is lexicographically least among all chains in the interval [x, y].…”
Section: Techniques For Computing the Ab-and Cd-indexesmentioning
confidence: 62%
“…Examples of such posets and permutation sets are the Boolean algebra and André permutations, and the cubical lattice and signed André permutations. See [8,17]. For more refined identities using such a poset-permutation set correspondence, see [6,11,20].…”
Section: On Simsun Permutationsmentioning
confidence: 99%
“…We will assume that the reader is familiar with R-labelings. Otherwise, see [8] or [19,Section 3.13]. …”
Section: Theorem 92 Let P and Q Be Two Posets Thenmentioning
confidence: 99%
See 1 more Smart Citation
“….) has been given implicitly by Ehrenborg and Readdy [5] in terms of nonaugmented André R-signed permutations on [n] with R = (4, 4, . .…”
Section: )mentioning
confidence: 99%