报告题目:How Small Can a Sum of Roots of Unity Be?
报告人:庄金成
报告时间:2019年8月1日,14:30-16:00
报告地点:知新楼B座1219报告厅
摘要:In this talk, we count the number of ways to represent an element in a prime finite field as a sum of elements from different multiplesof a small subset. More generally, we study the problem of solution countingof certain linear equations over subsets of finite fields. We establish the basicproperties about the number of solutions,and connect the number withlower bounds of complex norms of sums of roots of unity.
报告人简介:庄金成,博士,现为山东大学网络空间安全学院教授,博士生导师。主要研究领域为理论计算机,算法数论,编码学和密码学。研究成果发表在Algorithmic Number Theory Symposium (ANTS), IEEE Transactions on Information Theory (TIT), Designs Codes and Cryptography (DCC)等会议和期刊。
邀请人:王明强