Asyrec

swMATH8896MaRDI QIDQ20894FDOQ20894

Author name not available (Why is that?)

Cited In (9)

• Asymptotic \(r\)-log-convexity and P-recursive sequences
• Pattern avoidance in ordered set partitions
• A combinatorial-probabilistic analysis of bitcoin attacks
• The computational challenge of enumerating high-dimensional rook walks
• Crossings and nestings in colored set partitions
• The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
• Log-concavity of \(P\)-recursive sequences
• Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf
• Effective bounds for P-recursive sequences

This page was built for software: Asyrec