{"title":"阶梯上Flory模型变体的复杂度函数","authors":"Mate Puljiz, Stjepan Šebek, Josip Žubrinić","doi":"10.5592/co/ccd.2022.07","DOIUrl":null,"url":null,"abstract":"In this article, we compare the famous Flory model with its variant that was recently introduced by the authors. Instead of looking at these models on a one-dimensional lattice, we consider a two-row ladder. For both models we compute the complexity function, and we analyze the differences of static and dynamic versions of these models.","PeriodicalId":306191,"journal":{"name":"Proceedings of the 4th Croatian Combinatorial Days","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Complexity function for a variant of Flory model on a ladder\",\"authors\":\"Mate Puljiz, Stjepan Šebek, Josip Žubrinić\",\"doi\":\"10.5592/co/ccd.2022.07\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we compare the famous Flory model with its variant that was recently introduced by the authors. Instead of looking at these models on a one-dimensional lattice, we consider a two-row ladder. For both models we compute the complexity function, and we analyze the differences of static and dynamic versions of these models.\",\"PeriodicalId\":306191,\"journal\":{\"name\":\"Proceedings of the 4th Croatian Combinatorial Days\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.07\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th Croatian Combinatorial Days","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5592/co/ccd.2022.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complexity function for a variant of Flory model on a ladder
In this article, we compare the famous Flory model with its variant that was recently introduced by the authors. Instead of looking at these models on a one-dimensional lattice, we consider a two-row ladder. For both models we compute the complexity function, and we analyze the differences of static and dynamic versions of these models.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
