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:
Filippo Cammaroto (1996)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Some results on cleavability theory are presented. We also show some new [16]'s results.
G. L. Garg, B. Kumar (1989)
Matematički Vesnik
Similarity:
Tošić, Ratko, Vojvodić, Dušan (2000)
Novi Sad Journal of Mathematics
Similarity:
M. N. Mukherjee, S. Raychaudhuri (1993)
Matematički Vesnik
Similarity:
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Yukio Kömura (1970)
Studia Mathematica
Similarity:
M. Chrobak, S. Poljak (1987)
Applicationes Mathematicae
Similarity:
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.
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.