2000 character limit reached
Total positivity of Riordan arrays
Published 21 Jan 2016 in math.CO | (1601.05637v1)
Abstract: We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.