We evaluate the virial coefficients Bk for k ≤ 10 for hard spheres in dimensions D = 2, · · · , 8. Virial coefficients with k even are found to be negative when D ≥ 5. This provides strong evidence that the leading singularity for the virial series lies away from the positive real axis when D ≥ 5. Further analysis provides evidence that negative virial coefficients will be seen for some k > 10 ...

the virial coefficients can be obtained from statistical mechanics in connection with the intermolecular potentials. the intermolecular potential of polyatomic molecules is usually assumed to consist of a spherically symmetric component plus a contribution due to asphericaity of the molecular charge distribution. in this study, the second virial coefficients have been calculated for n2, co and ...

We consider the problem of finding explicit formulae, recurrence relations and sign properties for both connection and linearization coefficients for generalized Hermite polynomials. The most computations are carried out by the computer algebra system Maple using appropriate algorithms.

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

This paper gives a qualitative description how Young tableaux can be used to perform a Clebsch-Gordan decomposition of tensor products in SU(3) and how this can be generalized to SU(N).

This essay describes the development of groups used for the specification of symmetries from ordinary and magnetic point groups to Fedorov and magnetic space groups, as well as other varieties of groups useful in the study of symmetric objects. In particular, we consider the problem of some incorrectness in Vol. A of the International Tables for Crystallography. Some results of tensor calculus ...

Let S = (s1, s2, . . .) be any sequence of nonnegative integers and let Sk = ∑k i=1 si We then define the falling (rising) factorials relative to S by setting (x)↓k,S= (x−S1)(x−S2) · · · (x−Sk) and (x)↑k,S= (x+S1)(x+S2) · · · (x+Sk) if k ≥ 1 with (x)↓0,S= (x)↑0,S= 1. It follows that {(x)↓k,S}k≥0 and {(x)↑k,S}k≥0 are bases for the polynomial ring Q[x]. We use a rook theory model due to Miceli an...

Fast and efficient methods of evaluation of the connection coefficients between shifted Jacobi and Bernstein polynomials are proposed. The complexity of the algorithms is O(n), where n denotes the degree of the Bernstein basis. Given results can be helpful in a computer aided geometric design, e.g., in the optimization of some methods of the degree reduction of Bézier curves.

The linearization problem is the problem of finding the coefficients Ck (m,n) in the expansion of the product Pn(x)Qm(x) of two polynomial systems in terms of a third sequence of polynomials Rk (x), Pn(x)Qm(x) = n+m ∑ k=0 Ck (m,n)Rk (x). The polynomials Pn , Qm and Rk may belong to three different polynomial families. In the case P = Q = R, we get the (standard ) linearization or Clebsch-Gordan...