组合为条形图

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-02-16 DOI:10.47443/dml.2022.0002

T. Mansour, A. S. Shabani

{"title":"组合为条形图","authors":"T. Mansour, A. S. Shabani","doi":"10.47443/dml.2022.0002","DOIUrl":null,"url":null,"abstract":"In this paper, we consider statistics on combinations of [n] when combinations are presented as bargraphs. The statistics we consider are cardinality of a combination, semi-perimeter, outer site-perimeter, and inner site-perimeter. We find an explicit formula for the generating function for the number of combinations of [n] according to the considered statistics. We also find an explicit formula for the total of the above statistics over all combinations of [n].","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combinations as Bargraphs\",\"authors\":\"T. Mansour, A. S. Shabani\",\"doi\":\"10.47443/dml.2022.0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider statistics on combinations of [n] when combinations are presented as bargraphs. The statistics we consider are cardinality of a combination, semi-perimeter, outer site-perimeter, and inner site-perimeter. We find an explicit formula for the generating function for the number of combinations of [n] according to the considered statistics. We also find an explicit formula for the total of the above statistics over all combinations of [n].\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，当组合被表示为条形图时，我们考虑[n]的组合的统计量。我们考虑的统计数据是组合的基数、半周长、外站点周长和内站点周长。根据所考虑的统计量，我们找到了[n]组合数的生成函数的一个显式公式。我们还发现了在[n]的所有组合上上述统计的总和的显式公式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Combinations as Bargraphs

In this paper, we consider statistics on combinations of [n] when combinations are presented as bargraphs. The statistics we consider are cardinality of a combination, semi-perimeter, outer site-perimeter, and inner site-perimeter. We find an explicit formula for the generating function for the number of combinations of [n] according to the considered statistics. We also find an explicit formula for the total of the above statistics over all combinations of [n].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks