Reverse lexicographic and lexicographic shifting

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, Δ lex - an operation that transforms a monomial ideal of S = k[x i,: i ∈ ℕ] that is finitely generated in each degree into a squarefree strongly stable ideal - is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a squarefree strongly stable ideal I ⊂ S is fixed by lexicographic shifting if and only if I is a universal squarefree lexsegment ideal (abbreviated USLI) of S. Moreover, in the case when I is finitely generated and is not a USLI, it is verified that all the ideals in the sequence {Δ lexi(I)} i=0∞ are distinct. The limit ideal Δ̄(I) = lim i → ∞ Δ(I) is well defined and is a USLI that depends only on a certain analog of the Hubert function of I. © Springer Science + Business Media, Inc. 2006.

Author supplied keywords

Cite

CITATION STYLE

APA

Babson, E., Novik, I., & Thomas, R. (2006). Reverse lexicographic and lexicographic shifting. Journal of Algebraic Combinatorics, 23(2), 107–123. https://doi.org/10.1007/s10801-006-6919-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free