Hi,<BR><BR>I'm currently coding a function in Java that will find the number of possible combinations for a string. I've run into a problem in to a problem with regards to both speed and memory usage.

Eulerian polynomials have long occupied a central role in combinatorics, encapsulating critical information about permutation statistics. In their classical formulation, these polynomials encode the ...