{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
