{"title":"Solving the dimer problem on Apollonian gasket","authors":"T. Došlić, Luka Podrug","doi":"10.5592/co/ccd.2022.02","DOIUrl":null,"url":null,"abstract":"For any three circles in the plane where each circle is tangent to the other two, the Descartes’ theorem yields the existence of a fourth circle tangent to the starting three. Continuing this process by adding a new circle between any three tangent circles leads to Apollonian packings. The fractal structures resulting from infinite continuation of such processes are known as Apollonian gaskets. Close-packed dimer configurations on such structures are well modeled by perfect matchings in the corresponding graphs. We consider Apollonian gaskets for several types of initial configurations and present explicit expressions for the number of perfect matchings in such graphs","PeriodicalId":306191,"journal":{"name":"Proceedings of the 4th Croatian Combinatorial Days","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th Croatian Combinatorial Days","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5592/co/ccd.2022.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
For any three circles in the plane where each circle is tangent to the other two, the Descartes’ theorem yields the existence of a fourth circle tangent to the starting three. Continuing this process by adding a new circle between any three tangent circles leads to Apollonian packings. The fractal structures resulting from infinite continuation of such processes are known as Apollonian gaskets. Close-packed dimer configurations on such structures are well modeled by perfect matchings in the corresponding graphs. We consider Apollonian gaskets for several types of initial configurations and present explicit expressions for the number of perfect matchings in such graphs