Four-Letter Words: The Distribution of Pattern Frequencies in Ring Permutations
四字母词:环形排列中模式频数的分布AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究随机排列的组合概率与模式计数,未明确对应所列经济计量细分领域。
反馈分类问题四字母词:环形排列中模式频数的分布AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary An alphabet of c letters is considered. There are, then, ck possible ordered sequences of k of these. Such k-sequences are grouped into λ mutually exclusive and exhaustive sets; members of each set (called k-patterns) are counted the same. A general expression for the joint generating function of the frequencies of occurrence of the different k-patterns is obtained when r letters, with fixed numbers of each sort, are randomly arranged in a ring. In particular, k-sequences which comprise the same set of letters, in whatever order, are called k-words. Explicit expressions are obtained for the cases k = 3, 4, c = 2 both from the generating function and by direct combinatorial arguments. The asymptotic (multinormal) limiting distribution is obtained for the general case and more explicitly for k-letter words.