The search session has expired. Please query the service again.
In the present paper we investigate distributional properties of sparse sequences modulo almost all prime numbers. We obtain new results for a wide class of sparse sequences which in particular find applications on additive problems and the discrete Littlewood problem related to lower bound estimates of the -norm of trigonometric sums.
Let G be a finite cyclic group. Every sequence S over G can be written in the form where g ∈ G and , and the index ind(S) is defined to be the minimum of over all possible g ∈ G such that ⟨g⟩ = G. A conjecture says that every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6) = 1 has index 1. This conjecture was confirmed recently for the case when |G| is a product of at most two prime powers. However, the general case is still open. In this paper, we make some...
For each we consider the -bonacci numbers defined by for and for When these are the usual Fibonacci numbers. Every positive integer may be expressed as a sum of distinct -bonacci numbers in one or more different ways. Let be the number of partitions of as a sum of distinct -bonacci numbers. Using a theorem of Fine and Wilf, we obtain a formula for involving sums of binomial coefficients modulo In addition we show that this formula may be used to determine the number of partitions...
A subset of a finite abelian group, written additively, is called zero-sumfree if the sum of the elements of each non-empty subset of is non-zero. We investigate the maximal cardinality of zero-sumfree sets, i.e., the (small) Olson constant. We determine the maximal cardinality of such sets for several new types of groups; in particular, -groups with large rank relative to the exponent, including all groups with exponent at most five. These results are derived as consequences of more general...
We study the structure of longest sequences in which have no zero-sum subsequence of length n (or less). We prove, among other results, that for and d arbitrary, or and d = 3, every sequence of c(n,d)(n-1) elements in which has no zero-sum subsequence of length n consists of c(n,d) distinct elements each appearing n-1 times, where and .
A graph G is called (H;k)-vertex stable if G contains a subgraph isomorphic to H ever after removing any of its k vertices. Q(H;k) denotes the minimum size among the sizes of all (H;k)-vertex stable graphs. In this paper we complete the characterization of -vertex stable graphs with minimum size. Namely, we prove that for m ≥ 2 and n ≥ m+2, and as well as are the only -vertex stable graphs with minimum size, confirming the conjecture of Dudek and Zwonek.
Currently displaying 21 –
32 of
32