1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
Intractable enumeration problems are like Russian nesting dolls: structural properties of monomer-dimer coverings on two-dimensional quadratic lattices
Yong Kong
Counting the number of coverings of dimers on two-dimensional quadratic lattices is considered as intractable and belongs to \#P-complete class. We reveal the structure of the…
math.CO2024
Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices
Yong Kong
In the monomer-polymer model, a linear rigid polymer covers adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called -mers, an…