Coloured Hard-Dimers
Maria Simonetta Bernabei, Horst Thaler
TL;DR
This paper investigates the averaged generating function for coloured hard-dimers by establishing estimates and explores two enumerating problems and their distributions through numerical analysis.
Contribution
It introduces new estimates for the generating function and examines two distinct enumerating problems related to coloured hard-dimers.
Findings
Derived bounds for the generating function.
Numerical analysis of enumerating problem distributions.
Abstract
An averaged generating function for coloured hard-dimers is being investigated by proving estimates for the latter. Furthermore, two different enumerating problems and their distributions are studied numerically.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Diffusion and Search Dynamics