在网格上行走

Manija Shahali, H. A. ShahAli
{"title":"在网格上行走","authors":"Manija Shahali, H. A. ShahAli","doi":"10.1017/mag.2024.17","DOIUrl":null,"url":null,"abstract":"There are various combinatorial questions on rectangular arrays consisting of points, numbers, fields or, in general, of symbols such as chessboards, lattices, and graphs. Many such problems in enumerative combinatorics come from other branches of science and technology like physics, chemistry, computer sciences and engineering; for example the following two very challenging problems from chemistry:\nProblem 1: Dimer problem (Domino tiling)\nIn chemistry, a large molecule composed repeatedly from monomers as a long chain is called a polymer and a dimer is composed of two monomers (where: mono = 1, di = 2, poly = many and mer = part).","PeriodicalId":22812,"journal":{"name":"The Mathematical Gazette","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Walk on a grid\",\"authors\":\"Manija Shahali, H. A. ShahAli\",\"doi\":\"10.1017/mag.2024.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are various combinatorial questions on rectangular arrays consisting of points, numbers, fields or, in general, of symbols such as chessboards, lattices, and graphs. Many such problems in enumerative combinatorics come from other branches of science and technology like physics, chemistry, computer sciences and engineering; for example the following two very challenging problems from chemistry:\\nProblem 1: Dimer problem (Domino tiling)\\nIn chemistry, a large molecule composed repeatedly from monomers as a long chain is called a polymer and a dimer is composed of two monomers (where: mono = 1, di = 2, poly = many and mer = part).\",\"PeriodicalId\":22812,\"journal\":{\"name\":\"The Mathematical Gazette\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Mathematical Gazette\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/mag.2024.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Mathematical Gazette","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/mag.2024.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

关于由点、数、场或一般符号(如棋盘、网格和图形)组成的矩形阵列,有各种各样的组合问题。枚举组合学中的许多此类问题来自物理学、化学、计算机科学和工程学等其他科学和技术分支,例如以下两个极具挑战性的化学问题:问题 1:二聚体问题(多米诺牌阵)在化学中,由单体作为长链反复组成的大分子称为聚合物,二聚体由两个单体组成(其中:mono = 1,di = 2,poly = 许多,mer = 部分)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Walk on a grid
There are various combinatorial questions on rectangular arrays consisting of points, numbers, fields or, in general, of symbols such as chessboards, lattices, and graphs. Many such problems in enumerative combinatorics come from other branches of science and technology like physics, chemistry, computer sciences and engineering; for example the following two very challenging problems from chemistry: Problem 1: Dimer problem (Domino tiling) In chemistry, a large molecule composed repeatedly from monomers as a long chain is called a polymer and a dimer is composed of two monomers (where: mono = 1, di = 2, poly = many and mer = part).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信