Counting finite -sequences of a given multiplicity
arXiv:2507.23438 · doi:10.1007/s00200-026-00746-5
Abstract
We study the number of finite -sequences of a given multiplicity , with particular attention to the computation of . We show that the sequence is sub-Fibonacci, and that if the sequence converges, its limit is bounded above by the golden ratio. This analysis also produces an elementary method for computing . In addition, we derive an iterative formula for by exploiting a decomposition of lex-segment ideals introduced by S. Linusson in a previous work.
arXiv commentFixed some oversights in the proof of Lemma 2.2 and in the proof of Proposition 2.3; improvement of Proposition 2.5 and of Remark 2.6