Counting perfect matchings in polyominoes with an application to the dimer problem
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
M. N. Mukherjee, S. Raychaudhuri (1993)
Matematički Vesnik
Similarity:
Tošić, Ratko, Vojvodić, Dušan (2000)
Novi Sad Journal of Mathematics
Similarity:
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Min Tang, Xiao-Zhi Ren, Meng Li (2013)
Colloquium Mathematicae
Similarity:
For a positive integer n, let σ(n) denote the sum of the positive divisors of n. Let d be a proper divisor of n. We call n a near-perfect number if σ(n) = 2n + d, and a deficient-perfect number if σ(n) = 2n - d. We show that there is no odd near-perfect number with three distinct prime divisors and determine all deficient-perfect numbers with at most two distinct prime factors.
Tomohiro Yamada (2005)
Colloquium Mathematicae
Similarity:
We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.
Ivan Gutman (1989)
Publications de l'Institut Mathématique
Similarity:
Giorgio Nordo (1997)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper we generalize the notion of of a Tychonoff space to a generic extension of any space by introducing the concept of . This allow us to simplify the treatment in a basic way and in a more general setting. Some [S], [S], and [D]’s results are improved and new characterizations for perfect (Hausdorff) extensions of spaces are obtained.
Asadulla, Syed (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity: