Counting perfect matchings in polyominoes with an application to the dimer problem
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Existence of regular solutions for a one-dimensional simplified perfect-plastic problem with a unilateral gradient constraint.”
Counting perfect matchings in polyominoes with an application to the dimer problem
Cleavability and divisibility over developable spaces
Filippo Cammaroto (1996)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Some results on cleavability theory are presented. We also show some new [16]'s results.
C-closed functions
G. L. Garg, B. Kumar (1989)
Matematički Vesnik
Similarity:
The number of 1-factors in some polyhexes.
Tošić, Ratko, Vojvodić, Dušan (2000)
Novi Sad Journal of Mathematics
Similarity:
A Unified Theory of Perfect and Related Functions
M. N. Mukherjee, S. Raychaudhuri (1993)
Matematički Vesnik
Similarity:
A Property Of The Number Of Perfect Matchings Of A Graph
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Duality of linear spaces of functions and nuclearity of solution spaces
Yukio Kömura (1970)
Studia Mathematica
Similarity:
A generalization of Smith's theorem
M. Chrobak, S. Poljak (1987)
Applicationes Mathematicae
Similarity:
Odd perfect numbers of a special form
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.
On near-perfect and deficient-perfect numbers
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.