Academic Journal
Counting finite O-sequences of a given multiplicity.
| Τίτλος: | Counting finite O-sequences of a given multiplicity. |
|---|---|
| Συγγραφείς: | Cioffi, Francesca1 (AUTHOR) cioffifr@unina.it, Guida, Margherita1 (AUTHOR) maguida@unina.it |
| Πηγή: | Applicable Algebra in Engineering, Communication & Computing. Sep2026, Vol. 37 Issue 5, p991-1002. 12p. |
| Θεματικοί όροι: | *Multiplicity (Mathematics), *Fibonacci sequence, *Golden ratio, *Recursive sequences (Mathematics), *Combinatorics, *Mathematical sequences |
| Περίληψη: | We study the number O d of finite O-sequences of a given multiplicity d, with particular attention to the computation of O d . We show that the sequence (O d) d is sub-Fibonacci and that, unlike the Fibonacci sequence, every term of (O d / O d - 1) d with d ≥ 6 is bounded above by the golden ratio. This analysis also produces an elementary method for computing O d . In addition, we derive an iterative formula for O d by exploiting a decomposition of lex-segment ideals introduced by S. Linusson in a previous work. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: | Academic Search Index |
καταχωρήστε σχόλιο πρώτοι!