Proof of a conjecture of Stanley about Stern's array

MaRDI QIDQ5094104zbMATH OpenFDO

Authors David E Speyer

Publication date 2 August 2022

Full work available at URL https://arxiv.org/abs/1901.06301, https://cs.uwaterloo.ca/journals/JIS/VOL25/Speyer/speyer5.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Stern sequenceStern's diatomic array

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Abstract: Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n,2k)=s(n-1,k)$, $s(n,2k+1)=s(n-1,k)+s(n-1,k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:=su{m}_{k}s(n,k{)}^r$ obeys a homogeneous linear recurrence in $n$ of length $r/2+O(1)$. Numerical evidence, however, suggested that $s_n^r$ obeys shorter recurrences, of length $r/3+O(1)$. We prove Stanley's conjecture.

Recommendations

• Stanley's conjectures on the Stern poset
• Proof of a conjecture of Stanley-Zanello
• Proof of Stahl's conjecture in some new cases
• A proof of Steutel's conjecture
• On a Conjecture of S. Stahl
• Proof of the Barker array conjecture
• Proof of a conjecture of Kleinberg-Sawin-Speyer
• A conjecture of Stanley on alternating permutations
• scientific article; zbMATH DE number 613231

Cites work

• Some linear recurrences motivated by Stern's diatomic array

Cited in

(5)

• Stanley's conjectures on the Stern poset
• Largest values of the Stern sequence, alternating binary expansions and continuants
• Some linear recurrences motivated by Stern's diatomic array
• Hardinian arrays
• Theorems and conjectures on some rational generating functions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Proof of a conjecture of Stanley about Stern's array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094104)