Log-convexity of combinatorial sequences from their convexity (CROSBI ID 161308)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Došlić, Tomislav
engleski
Log-convexity of combinatorial sequences from their convexity
A sequence $(x_n)_{; ; ; ; ; n \geq 0}; ; ; ; ; $ of positive real numbers is log-convex if the inequality $x_n^2 \leq x_{; ; ; ; ; n-1}; ; ; ; ; x_{; ; ; ; ; n+1}; ; ; ; ; $ is valid for all $n \geq 1$. We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is log-convex.
log-convexity; convexity; combinatorial sequences; Motzkin numbers
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano