Complexity function for a variant of Flory model on a ladder

Mate Puljiz, Stjepan Šebek, Josip Žubrinić
{"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}
引用次数: 1

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.
阶梯上Flory模型变体的复杂度函数
在本文中,我们将著名的Flory模型与作者最近介绍的Flory模型的变体进行比较。我们不是在一维晶格上看这些模型,而是考虑一个两排阶梯。对于这两种模型,我们都计算了复杂度函数,并分析了这些模型的静态版本和动态版本的差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信