Applicable Algebra in Engineering, Communication and Computing Computer science
Counting finite O-sequences of a given multiplicity
Abstract
Abstract We study the number $$O_d$$ O d of finite O -sequences of a given multiplicity d , with particular attention to the computation of $$O_d$$ O d . We show that the sequence $$(O_d)_d$$ ( O d ) d is sub-Fibonacci and that, unlike the Fibonacci sequence, every term of $$(O_d /O_{d-1})_d$$ ( O d / O d - 1 ) d with $$d\ge 6$$ d ≥ 6 is bounded above by the golden ratio. This analysis also produces an elementary method for computing $$O_d$$ O d . In addition, we derive an iterative formula for $$O_d$$ O d by exploiting a decomposition of lex-segment ideals introduced by S. Linusson in a previous work.