On the number of square-cell configurations
✍ Scribed by Wolfgang R. Müller; Klaus Szymanski; Jan V. Knop; Nenad Trinajstić
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 503 KB
- Volume
- 86
- Category
- Article
- ISSN
- 1432-2234
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A necessary and sufficient graph-theoretic condition is given for the number of different colorings, or regular configurations, on lattice points 1, 2,..., n in R to grow exponentially in n. This condition also characterizes when the largest eigenvalue of a zero-one matrix is greater than one. A sim
Central configurations axe critical points of the potential function of the nbody problem restricted to the topological sphere where the moment of inertia is equal to constant. For a given set of positive masses ml,..., mn we denote by N(ml,..., ran, k) the number of central configurations" of the n
An Abelian square-free substitution on four letters is exhibited. We derive that. on a fourletter alphabet, the number of Abelian square-free words of each length grows exponentially. infinite Abelian square-free words are uncountable and the monoid of Abelian square-free endomorphisms is not finit