The representation matrices generated by the projected spin functions have some very interesting properties. All the matrix elements are integers and they are quite sparse. A very efficient algorithm is presented for the calculation of these representation matrices based on a graphical approach and
On the sizes of projections: A generating function approach
✍ Scribed by Danièle Gardy; Claude Puech
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 412 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0959-2954
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Given a cycle with n nodes a random subgraph is created by 'accepting' edges with probability p and 'rejecting' them with probability q = 1 -p. The parameter of interest is the order of the largest component. There are some partial answers to this question in the literature. Using an appropriate enc
A generalized stochastic model has been developed for systems of n-component first-order reactions by means of the probability generating function approach. A comparison of the stochastic model with the deterministic model is given.
The projection operator method is used and a suitabte set of trial functions is suggcstcd. The projections of these functions are finearly independent. The br~nci~in~d~~r~rn Serber-functions are obtained from the projected functions by a Schmjdt-ortllo~on~lization procedure. The Scrber-type spin e