On a combinatorial problem of Erdös, Ginzburg, and Ziv
نویسندگان
چکیده
منابع مشابه
A Weighted Erdös-Ginzburg-Ziv Theorem
An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct so that they can be considered as sets. If S is a sequence of m+ n− 1 elements from a finite abelian group G of order m and exponent k, and if W = {wi}i=1 is a ...
متن کاملOn the structure of p - zero - sum free sequences and its application to a variant of Erdös – Ginzburg – Ziv theorem
On the structure of p p p-zero-sum free sequences and its application to a variant of Erdös–Ginzburg–Ziv theorem Abstract. Let p be any odd prime number. Let k be any positive integer such that 2 ≤ k ≤ p+1 3 + 1. Let S = (a 1 , a 2 ,. .. , a 2p−k) be any sequence in Z p such that there is no subsequence of length p of S whose sum is zero in Z p. Then we prove that we can arrange the sequence S ...
متن کاملThe Chevalley - Warning Theorem ( Featuring . . . the Erdös - Ginzburg - Ziv Theorem ) Pete
In this handout we shall discuss a result that was conjectured by Emil Artin in 1935 and proved shortly thereafter by Claude Chevalley. A refinement was given by Artin’s graduate student Ewald Warning, who, as the story goes, was the one whom Artin had intended to prove the theorem before Chevalley came visiting Göttingen and got Artin to say a little too much about the mathematics his student ...
متن کاملOn a problem of Erdös and Graham
In this paper we provide bounds for the size of the solutions of the Diophantine equation x(x+ 1)(x+ 2)(x+ 3)(x+ k)(x+ k+ 1)(x+ k+ 2)(x+ k+ 3) = y, where 4 ≤ k ∈ N is a parameter. We also determine all integral solutions for 1 ≤ k ≤ 10.
متن کاملOn a Problem of P . Erdös and S. Stein
is called a covering system if every integer satisfies at least one of the congruences (1) . An old conjecture of P . Erdös states that for every integer a there is a covering system with n l = c. Selfridge and others settled this question for c < 8 . The general case is still unsettled and seems difficult . A system (1) is called disjoint if every integer satisfies at most one of the congruenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1976
ISSN: 0022-314X
DOI: 10.1016/0022-314x(76)90021-4