多变量FROBENIUS集上的加权SYLVESTER和

IF 0.6 4区数学 Q3 MATHEMATICS Kyushu Journal of Mathematics Pub Date : 2021-01-12 DOI:10.2206/kyushujm.76.163

T. Komatsu, Yuan Zhang

{"title":"多变量FROBENIUS集上的加权SYLVESTER和","authors":"T. Komatsu, Yuan Zhang","doi":"10.2206/kyushujm.76.163","DOIUrl":null,"url":null,"abstract":"Given positive integers a1, . . . , ak with gcd(a1, . . . , ak) = 1, it is well-known that all sufficiently large n can be represented as a nonnegative integer combination of a1, . . . , ak. The Frobenius Problem is to determine the largest positive integer that is NOT representable as a nonnegative integer combination of given positive integers that are coprime (see [15] for general references). This number is denoted by g(a1, . . . , ak) and often called Frobenius number. The Frobenius Problem has been also known as the Coin Exchange Problem (or Postage Stamp Problem / Chicken McNugget Problem), which","PeriodicalId":49929,"journal":{"name":"Kyushu Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2021-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"WEIGHTED SYLVESTER SUMS ON THE FROBENIUS SET IN MORE VARIABLES\",\"authors\":\"T. Komatsu, Yuan Zhang\",\"doi\":\"10.2206/kyushujm.76.163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given positive integers a1, . . . , ak with gcd(a1, . . . , ak) = 1, it is well-known that all sufficiently large n can be represented as a nonnegative integer combination of a1, . . . , ak. The Frobenius Problem is to determine the largest positive integer that is NOT representable as a nonnegative integer combination of given positive integers that are coprime (see [15] for general references). This number is denoted by g(a1, . . . , ak) and often called Frobenius number. The Frobenius Problem has been also known as the Coin Exchange Problem (or Postage Stamp Problem / Chicken McNugget Problem), which\",\"PeriodicalId\":49929,\"journal\":{\"name\":\"Kyushu Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kyushu Journal of Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2206/kyushujm.76.163\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kyushu Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2206/kyushujm.76.163","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 16

摘要

给定正整数a1，在gcd（a1，…，ak）=1的情况下，众所周知，所有足够大的n都可以表示为a1，…的非负整数组合，ak。Frobenius问题是确定不可表示为互质的给定正整数的非负整数组合的最大正整数（参见[15]的一般参考文献）。这个数用g（a1，…，ak）表示，通常被称为弗罗贝尼乌斯数。Frobenius问题也被称为硬币交换问题（或邮票问题/麦乐鸡问题）

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

WEIGHTED SYLVESTER SUMS ON THE FROBENIUS SET IN MORE VARIABLES

Given positive integers a1, . . . , ak with gcd(a1, . . . , ak) = 1, it is well-known that all sufficiently large n can be represented as a nonnegative integer combination of a1, . . . , ak. The Frobenius Problem is to determine the largest positive integer that is NOT representable as a nonnegative integer combination of given positive integers that are coprime (see [15] for general references). This number is denoted by g(a1, . . . , ak) and often called Frobenius number. The Frobenius Problem has been also known as the Coin Exchange Problem (or Postage Stamp Problem / Chicken McNugget Problem), which

求助全文

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

来源期刊

Kyushu Journal of Mathematics 数学-数学

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The Kyushu Journal of Mathematics is an academic journal in mathematics, published by the Faculty of Mathematics at Kyushu University since 1941. It publishes selected research papers in pure and applied mathematics. One volume, published each year, consists of two issues, approximately 20 articles and 400 pages in total. More than 500 copies of the journal are distributed through exchange contracts between mathematical journals, and available at many universities, institutes and libraries around the world. The on-line version of the journal is published at "Jstage" (an aggregator for e-journals), where all the articles published by the journal since 1995 are accessible freely through the Internet.