Abstract
We calculate the configurational entropy of random tilings obtained by elementary flips from a perfect octagonal tiling with an octagonal boundary. We map the problem of generating all configurations onto a partition problem. We calculate numerically the number of configurations and the associated entropy. We give some exact expressions in restricted cases and upper bounds for the entropy in the asymptotic case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
