The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 1261 –
1280 of
3028
We assign to each pair of positive integers and a digraph whose set of vertices is and for which there is a directed edge from to if . The digraph is semiregular if there exists a positive integer such that each vertex of the digraph has indegree or 0. Generalizing earlier results of the authors for the case in which , we characterize all semiregular digraphs when is arbitrary.
Let G be an additive finite abelian group. For every positive integer ℓ, let be the smallest positive integer t such that each sequence S over G of length |S| ≥ t has a nonempty zero-sum subsequence of length not equal to ℓ. In this paper, we determine for certain finite groups, including cyclic groups, the groups and elementary abelian 2-groups. Following Girard, we define disc(G) as the smallest positive integer t such that every sequence S over G with |S| ≥ t has nonempty zero-sum subsequences...
Let be the polynomial ring over the finite field , and let be the subset of containing all polynomials of degree strictly less than N. Define D(N) to be the maximal cardinality of a set for which A-A contains no squares of polynomials. By combining the polynomial Hardy-Littlewood circle method with the density increment technology developed by Pintz, Steiger and Szemerédi, we prove that .
Currently displaying 1261 –
1280 of
3028