Bounds on image sets of planar functions
Người báo cáo: Steven Senger (Missouri State University)
Time: 9:30 -- 11: 00, July 09, 2025
Venue: Room 612, A6, Institute of Mathematics-VAST
Abstract: planar function $f$ is a polynomial over a finite field with the property that for every $ainmathbb F_q^*,$ the function $f(x+a)-f(x)$ has a full image. One longstanding question in the intersection of finite geometry, cryptography, and finite fields is the upper bound of the size of the image set of a planar function. We give the best known upper bounds via an almost completely combinatorial argument. However, we believe that our bound can be improved, as if it is tight, this would imply the existence of a projective plane of order 18, violating the prime-power conjecture for projective planes. We hope to eventually see tighter bounds that exploit the underlying algebraic structures, which we have not yet been able to use.
Tin tức nổi bật
Hoạt động tuần
Hội thảo sắp diễn ra
Xuất bản mới
Nguyễn Khoa Sơn,
Nguyễn Thị Hồng,
Lê Văn Ngọc,
Stability conditions for a class of nonlinear timevarying switched systems with delays and sectortype nonlinearities,
International Journal of Systems Science, Volume 57(2), (2025), 441-461
(SCI(-E); Scopus)
.
Trần Văn Thắng,
Lê Xuân Thanh,
Đỗ Thị Thùy,
A monotonic optimization approach to mixed variational inequality problems,
Optimization Letters, Volume 19, pages 1779–1800, (2025)
(SCI-E, Scopus)
.
Nguyễn Hữu Sáu,
Piyapong Niamsup,
Vũ Ngọc Phát,
Linear Programming Approach to Constrained Stabilization of Positive Differential-Difference Equations With Unbounded Delay,
Optimal Control Applications and Methods, 2025; 46:2581--2594
(SCI-E, Scopus)
.