Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Log-convexity of combinatorial sequences from their convexity (CROSBI ID 161308)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Došlić, Tomislav Log-convexity of combinatorial sequences from their convexity // Journal of mathematical inequalities, 3 (2009), 3; 437-442

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

Podaci o izdanju

3 (3)

2009.

437-442

objavljeno

1846-579X

Povezanost rada

Matematika