|
ВИДЕОТЕКА |
|
Erdös-Ginzburg-Ziv problem and Convex Geometry Д. А. Захаров |
|||
Аннотация: Let In [2], we show that for any fixed Note that we have a lower bound The proof combines various ideas from convex geometry, additive combinatorics and algebraic combinatorics. [1] Alon Noga and Moshe Dubiner, A lattice point problem and additive number theory, Combinatorica 15.3 (1995): 301-309. [2] Zakharov Dmitriy, Convex geometry and Erdös-Ginzburg-Ziv problem, arXiv preprint arXiv:2002.09892 (2020). |