The Infinite limit of random permutations avoiding patterns of length three

R. Pinsky
{"title":"The Infinite limit of random permutations avoiding patterns of length three","authors":"R. Pinsky","doi":"10.1017/S0963548319000270","DOIUrl":null,"url":null,"abstract":"Abstract For $$\\tau \\in {S_3}$$, let $$\\mu _n^\\tau $$ denote the uniformly random probability measure on the set of $$\\tau $$-avoiding permutations in $${S_n}$$. Let $${\\mathbb {N}^*} = {\\mathbb {N}} \\cup \\{ \\infty \\} $$ with an appropriate metric and denote by $$S({\\mathbb{N}},{\\mathbb{N}^*})$$ the compact metric space consisting of functions $$\\sigma {\\rm{ = }}\\{ {\\sigma _i}\\} _{i = 1}^\\infty {\\rm{ }}$$ from $$\\mathbb {N}$$ to $${\\mathbb {N}^ * }$$ which are injections when restricted to $${\\sigma ^{ - 1}}(\\mathbb {N})$$; that is, if $${\\sigma _i}{\\rm{ = }}{\\sigma _j}$$, $$i \\ne j$$, then $${\\sigma _i} = \\infty $$. Extending permutations $$\\sigma \\in {S_n}$$ by defining $${\\sigma _j} = j$$, for $$j \\gt n$$, we have $${S_n} \\subset S({\\mathbb{N}},{{\\mathbb{N}}^*})$$. For each $$\\tau \\in {S_3}$$, we study the limiting behaviour of the measures $$\\{ \\mu _n^\\tau \\} _{n = 1}^\\infty $$ on $$S({\\mathbb{N}},{\\mathbb{N}^*})$$. We obtain partial results for the permutation $$\\tau = 321$$ and complete results for the other five permutations $$\\tau \\in {S_3}$$.","PeriodicalId":10503,"journal":{"name":"Combinatorics, Probability and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Probability and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/S0963548319000270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Abstract For $$\tau \in {S_3}$$, let $$\mu _n^\tau $$ denote the uniformly random probability measure on the set of $$\tau $$-avoiding permutations in $${S_n}$$. Let $${\mathbb {N}^*} = {\mathbb {N}} \cup \{ \infty \} $$ with an appropriate metric and denote by $$S({\mathbb{N}},{\mathbb{N}^*})$$ the compact metric space consisting of functions $$\sigma {\rm{ = }}\{ {\sigma _i}\} _{i = 1}^\infty {\rm{ }}$$ from $$\mathbb {N}$$ to $${\mathbb {N}^ * }$$ which are injections when restricted to $${\sigma ^{ - 1}}(\mathbb {N})$$; that is, if $${\sigma _i}{\rm{ = }}{\sigma _j}$$, $$i \ne j$$, then $${\sigma _i} = \infty $$. Extending permutations $$\sigma \in {S_n}$$ by defining $${\sigma _j} = j$$, for $$j \gt n$$, we have $${S_n} \subset S({\mathbb{N}},{{\mathbb{N}}^*})$$. For each $$\tau \in {S_3}$$, we study the limiting behaviour of the measures $$\{ \mu _n^\tau \} _{n = 1}^\infty $$ on $$S({\mathbb{N}},{\mathbb{N}^*})$$. We obtain partial results for the permutation $$\tau = 321$$ and complete results for the other five permutations $$\tau \in {S_3}$$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
避免长度为3的模式的随机排列的无限限制
对于$$\tau \in {S_3}$$,设$$\mu _n^\tau $$表示$${S_n}$$中$$\tau $$ -避免排列集合上的一致随机概率测度。设$${\mathbb {N}^*} = {\mathbb {N}} \cup \{ \infty \} $$用一个合适的度规,用$$S({\mathbb{N}},{\mathbb{N}^*})$$表示紧致度规空间,这个空间由从$$\mathbb {N}$$到$${\mathbb {N}^ * }$$的函数$$\sigma {\rm{ = }}\{ {\sigma _i}\} _{i = 1}^\infty {\rm{ }}$$组成,当限制在$${\sigma ^{ - 1}}(\mathbb {N})$$时,这些函数是注入;也就是说,如果$${\sigma _i}{\rm{ = }}{\sigma _j}$$, $$i \ne j$$,那么$${\sigma _i} = \infty $$。通过定义$${\sigma _j} = j$$扩展排列$$\sigma \in {S_n}$$,对于$$j \gt n$$,我们有$${S_n} \subset S({\mathbb{N}},{{\mathbb{N}}^*})$$。对于每个$$\tau \in {S_3}$$,我们研究了措施$$\{ \mu _n^\tau \} _{n = 1}^\infty $$在$$S({\mathbb{N}},{\mathbb{N}^*})$$上的极限行为。我们得到了该排列$$\tau = 321$$的部分结果和其他五个排列$$\tau \in {S_3}$$的完全结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new formula for the determinant and bounds on its tensor and Waring ranks On the Ramsey numbers of daisies I On the Ramsey numbers of daisies II List packing number of bounded degree graphs Counting spanning subgraphs in dense hypergraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1