关于不同点积的个数

Borbély József
{"title":"关于不同点积的个数","authors":"Borbély József","doi":"10.1109/CANDO-EPE57516.2022.10046375","DOIUrl":null,"url":null,"abstract":"In the Hungarian National Competition (OKTV) a mathematical problem concerning the number of distinct dot products determined by a general set of vectors was posed in the year 2019. A special result concerning the number of distint dot products had to be proved. The problem was probably the most difficult one in the problem list of this year. We will solve an extension of this problem and we will discuss some generalization possibilities of it. At the end of the paper we will discuss a conjecture concerning this problem.","PeriodicalId":127258,"journal":{"name":"2022 IEEE 5th International Conference and Workshop Óbuda on Electrical and Power Engineering (CANDO-EPE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On The Number of Distinct Dot Products\",\"authors\":\"Borbély József\",\"doi\":\"10.1109/CANDO-EPE57516.2022.10046375\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Hungarian National Competition (OKTV) a mathematical problem concerning the number of distinct dot products determined by a general set of vectors was posed in the year 2019. A special result concerning the number of distint dot products had to be proved. The problem was probably the most difficult one in the problem list of this year. We will solve an extension of this problem and we will discuss some generalization possibilities of it. At the end of the paper we will discuss a conjecture concerning this problem.\",\"PeriodicalId\":127258,\"journal\":{\"name\":\"2022 IEEE 5th International Conference and Workshop Óbuda on Electrical and Power Engineering (CANDO-EPE)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 5th International Conference and Workshop Óbuda on Electrical and Power Engineering (CANDO-EPE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CANDO-EPE57516.2022.10046375\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 5th International Conference and Workshop Óbuda on Electrical and Power Engineering (CANDO-EPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDO-EPE57516.2022.10046375","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在匈牙利国家竞赛(OKTV)中,2019年提出了一个关于由一般向量集确定的不同点积数量的数学问题。必须证明一个关于不同点积数目的特殊结果。这个问题可能是今年问题列表中最难的一个。我们将解决这个问题的一个扩展,并讨论它的一些推广可能性。在本文的最后,我们将讨论关于这个问题的一个猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On The Number of Distinct Dot Products
In the Hungarian National Competition (OKTV) a mathematical problem concerning the number of distinct dot products determined by a general set of vectors was posed in the year 2019. A special result concerning the number of distint dot products had to be proved. The problem was probably the most difficult one in the problem list of this year. We will solve an extension of this problem and we will discuss some generalization possibilities of it. At the end of the paper we will discuss a conjecture concerning this problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信