Bounds on the Higher Degree Erdos-Ginzburg-Ziv Constants over Fqn

Abstract

The classical Erdos-Ginzburg-Ziv constant of a group G denotes the smallest positive integer such that any sequence S of length at least contains a zero-sum subsequence of length (G). In a recent paper, Caro and Schmitt generalized this concept, using the m-th degree symmetric polynomial em(S) instead of the sum of the elements of S and considering subsequences of a given length t. In particular, they defined the higher degree Erdos-Ginzburg-Ziv constants EGZ(t,R,m) of a finite commutative ring R and presented several lower and upper bounds to these constants. This paper aims to provide lower and upper bounds for EGZ(t,R,m) in case R=Fqn. The lower bounds here presented have been obtained, respectively, using Lov\'asz Local Lemma and the Expurgation method and, for sufficiently large n, they beat the lower bound provided by Caro and Schmitt for the same kind of rings. Finally, we prove closed form upper bounds derived from the Ellenberg-Gijswijt and Sauermann results for the cap-set problem assuming that q = pk, t = p, and m=p-1. Moreover, using the Slice Rank method we derive a convex optimization problem that provides the best bounds for q = 3k, t = 3, m=2 and k=2,3,4,5.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…