ﻻ يوجد ملخص باللغة العربية
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the method also works for graphs without translational symmetry. The partition function for dimer coverings on these lattices can be determined also for a class of assignments of different activities to different edges.
Exact analyses are given for two three-dimensional lattice systems: A system of close-packed dimers placed in layers of honeycomb lattices and a layered triangular-lattice interacting domain wall model, both with nontrivial interlayer interactions. W
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known Hamiltonian
This paper has been withdrawn
We present the number of dimers $N_d(n)$ on the Sierpinski gasket $SG_d(n)$ at stage $n$ with dimension $d$ equal to two, three, four or five, where one of the outmost vertices is not covered when the number of vertices $v(n)$ is an odd number. The e
A lattice model of 3He - 4He mixtures which takes into account the continuous rotational symmetry O(2) of the superfluid degrees of freedom of 4He is studied in the molecular-field approximation and by Monte Carlo simulations in three dimensions. In