scholarly journals Upper Bounds for Stern's Diatomic Sequence and Related Sequences

10.37236/5342 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Colin Defant

Let $(s_2(n))_{n=0}^\infty$ denote Stern's diatomic sequence. For $n\geq 2$, we may view $s_2(n)$ as the number of partitions of $n-1$ into powers of $2$ with each part occurring at most twice. More generally, for integers $b,n\geq 2$, let $s_b(n)$ denote the number of partitions of $n-1$ into powers of $b$ with each part occurring at most $b$ times. Using this combinatorial interpretation of the sequences $s_b(n)$, we use the transfer-matrix method to develop a means of calculating $s_b(n)$ for certain values of $n$. This then allows us to derive upper bounds for $s_b(n)$ for certain values of $n$. In the special case $b=2$, our bounds improve upon the current upper bounds for the Stern sequence. In addition, we are able to prove that $\displaystyle{\limsup_{n\rightarrow\infty}\frac{s_b(n)}{n^{\log_b\phi}}=\frac{(b^2-1)^{\log_b\phi}}{\sqrt 5}}$.

10.37236/1572 ◽  
2001 ◽  
Vol 8 (1) ◽  
Author(s):  
Doron Zeilberger

This is the fourth installment of the five-part saga on the Umbral Transfer-Matrix method, based on Gian-Carlo Rota's seminal notion of the umbra. In this article we describe the Maple packages USAP, USAW, and MAYLIS. USAP automatically constructs, for any specific $r$, an Umbral Scheme for enumerating, according to perimeter, the number of self-avoiding polygons with $\leq 2r$ horizontal edges per vertical cross-section. The much more complicated USAW does the analogous thing for self-avoiding walks. Such Umbral Schemes enable counting these classes of self-avoiding polygons and walks in polynomial time as opposed to the exponential time that is required by naive counting. Finally MAYLIS is targeted to the special case of enumerating classes of saps with at most two horizontal edges per vertical cross-section (equivalently column-convex polyominoes by perimeter), and related classes. In this computationally trivial case we can actually automatically solve the equations that were automatically generated by USAP. As an example, we give the first fully computer-generated proof of the celebrated Delest-Viennot result that the number of convex polyominoes with perimeter $2n+8$ equals $(2n+11)4^n-4(2n+1)!/n!^2$.


Polymer ◽  
2004 ◽  
Vol 45 (2) ◽  
pp. 707-716 ◽  
Author(s):  
Andrzej Kloczkowski ◽  
Taner Z. Sen ◽  
Robert L. Jernigan

1994 ◽  
Vol 116 (3) ◽  
pp. 309-317 ◽  
Author(s):  
Yuan Kang ◽  
An-Chen Lee ◽  
Yuan-Pin Shih

A modified transfer matrix method (MTMM) is developed to analyze rotor-bearing systems with an asymmetric shaft and asymmetric disks. The rotating shaft is modeled by a Rayleigh-Euler beam considering the effects of the rotary inertia and gyroscopic moments. Specifically, a transfer matrix of the asymmetric shaft segments is derived in a continuous-system sense to give accurate solutions. The harmonic balance method is incorporated in the transfer matrix equations, so that steady-state responses of synchronous and superharmonic whirls can be determined. A numerical example is presented to demonstrate the effectiveness of this approach.


Sign in / Sign up

Export Citation Format

Share Document