Reverse Lexicographic and Lexicographic Shifting
Eric Babson, Isabella Novik, Rekha R. Thomas
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, Δ -- an operation that transforms a monomial ideal of S=[xi: 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 \Δi(I)\i=0∞ are distinct. The limit ideal Δ(I)=i∞Δi(I) is well defined and is a USLI that depends only on a certain analog of the Hilbert function of I.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell