Program for generating tables of SU(3) ⊃ SU(2) ⊗ U(1) coupling coefficients

A C-Language program which tabulates the isoscalar factors and Clebsch-Gordan coefficients for products of representations in SU(3) ⊃ SU(2) ⊗ U(1) is presented. These are efficiently computed using recursion relations, and the results are presented in exact precision as square roots of rational numbers. Output is in LaTeX format.     

Corrections to “A Robust Stochastic Genetic Algorithm (StGA) for Global Numerical Optimization”

In the above titled paper (ibid., vol 8, no. 5, pp. 456-470, Oct 04), there is an error in the programming of the stochastic genetic algorithm (StGA) presented in that paper. The origin and implications of the error are discussed here.     

Erratum to “Minimum cost flows with minimum quantities” [Information Processing Letters 111 (11) (2011) 533–537]

This note identifies an error in the fully polynomial-time approximation scheme on series-parallel graphs presented in our paper “Minimum cost flows with minimum quantities” which appeared as [Sven O. Krumke, Clemens Thielen, Minimum cost flows with minimum quantities, Information Processing Letters 111 (11) (2011) 533–537]. In fact, we prove inapproximability of the problem on series-parallel graphs and of a related problem, thereby identifying a similar error in a related paper.