Home An Analogue of the Erdős–Ginzburg–Ziv Theorem for Quadratic Symmetric Polynomials
Article
Licensed
Unlicensed Requires Authentication

An Analogue of the Erdős–Ginzburg–Ziv Theorem for Quadratic Symmetric Polynomials

  • Arie Bialostocki and Tran Dinh Luong
Published/Copyright: November 25, 2009
Become an author with De Gruyter Brill
Integers
From the journal Volume 9 Issue 5

Abstract

Let p be a prime and let φ ∈ ℤp[x1, x2, . . . , xp] be a symmetric polynomial, where ℤp is the field of p elements. A sequence T in ℤp of length p is called a φ-zero sequence if φ(T) = 0; a sequence in ℤp is called a φ-zero free sequence if it does not contain any φ-zero subsequence. Define g(φ, ℤp) to be the smallest integer l such that every sequence inℤp of length l contains a φ-zero sequence; if l does not exist, we set g(φ, ℤp) = ∞. Define M(φ, ℤp) to be the set of all φ-zero free sequences of length g(φ, ℤp) – 1, whenever g(φ, ℤp) is finite. The aim of this paper is to determine the value of g(φ, ℤp) and to describe the set M(φ, ℤp) for a quadratic symmetric polynomial φ in ℤp[x1, x2, . . . , xp].

Received: 2008-12-23
Accepted: 2009-05-20
Published Online: 2009-11-25
Published in Print: 2009-November

© de Gruyter 2009

Downloaded on 29.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/INTEG.2009.038/html
Scroll to top button