Combinatorics

FPSAC 2010

I'm currently happy attendant of FPSAC 2010 (formal power series & algebraic combinatorics) in San Francisco. My talk on random walks in the plane has been the very first regular one, which means that I can now fully enjoy all the other ones. read more »

Computer proved monotonicity of some coefficients

Ming-Hua Lin from the University of Regina sent me the following problem:

Problem: Let p ≥ 2 be an integer, and define

$$ f (t) = \left( \frac{1}{1 - t \left( \frac{1}{p} + \frac{p - 1}{2 p^2} t<br />
     \right)} \right)^p = \sum_{n \geqslant 0} c_n t^n . $$

Show that $ c_2 > c_3 > c_4 > \cdots $. read more »

CARMA workshop in Newcastle, 2009

On August 18, 2009, the University of Newcastle hosted a CARMA workshop on Multidimensional Numerical Integration and Special Function Evaluation. Besides enjoying very interesting talks it's been my pleasure to present, together with James Wan, on progress of our joint work with Jon Borwein, Peter Donovan and Dirk Nuyens on expectations of random walks. read more »

Attachment: 

Fast q-binomials in Mathematica

Recently, I have been doing experiments involving q-binomial coefficients in Mathematica. Starting with version 7, Mathematica is prepared for some q-business; in particular, there exists a function named QBinomial giving the q-analog of Binomial. However, this implementation turned out to not be fast enough for my needs. Here is an alternative approach which is not only way faster but provides a full factorization. read more »

Eulerian numbers

This short introduction to Eulerian numbers accompanied my talk for the WZ Theory class held by Tewodros Amdeberhan at Tulane University in Spring 2007. read more »

Syndicate content