Log-balanced combinatorial sequences | Zendy

Akbar Ali | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Log-balanced combinatorial sequences

Author(s) -

Akbar Ali

Publication year - 2005

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/ijmms.2005.507

Subject(s) - mathematics , sequence (biology) , combinatorics , class (philosophy) , term (time) , constraint (computer aided design) , discrete mathematics , regular polygon , genetics , physics , geometry , quantum mechanics , artificial intelligence , computer science , biology

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more-) term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research