共查询到20条相似文献,搜索用时 15 毫秒
1.
A Step Beyond Kneser's Theorem for Abelian Finite Groups 总被引:1,自引:0,他引:1
2.
Let G be a finite (additive written) abelian group of order n. Let w1,…,wn be integers coprime to n such that w1+w2+?+wn≡0 (mod n). Let I be a set of cardinality 2n-1 and let ξ={xi:i∈I} be a sequence of elements of G. Suppose that for every subgroup H of G and every a∈G, ξ contains at most terms in a+H.Then, for every y∈G, there is a subsequence {y1,…,yn} of ξ such that y=w1y1+?+wnyn.Our result implies some known generalizations of the Erd?s-Ginzburg-Ziv Theorem. 相似文献
3.
Jared Bass 《Journal of Number Theory》2007,126(2):217-236
Let G be a group of order m. Define s(G) to be the smallest value of t such that out of any t elements in G, there are m with product 1. The Erd?s-Ginzburg-Ziv theorem gives the upper bound s(G)?2m−1, and a lower bound is given by s(G)?D(G)+m−1, where D(G) is Davenport's constant. A conjecture by Zhuang and Gao [J.J. Zhuang, W.D. Gao, Erd?s-Ginzburg-Ziv theorem for dihedral groups of large prime index, European J. Combin. 26 (2005) 1053-1059] asserts that s(G)=D(G)+m−1, and Gao [W.D. Gao, A combinatorial problem on finite abelian groups, J. Number Theory 58 (1996) 100-103] has proven this for all abelian G. In this paper we verify the conjecture for a few classes of non-abelian groups: dihedral and dicyclic groups, and all non-abelian groups of order pq for p and q prime. 相似文献
4.
Alan Deckelbaum 《Journal of Number Theory》2009,129(6):1234-1245
Let G be a nonabelian group of order pq, where p and q are distinct odd primes. We analyze the minimum product set cardinality μG(r,s)=min|AB|, where A and B range over all subsets of G of cardinalities r and s, respectively. In this paper, we completely determine μG(r,s) in the case where G has order 3p and conjecture that this result can be extended to all nonabelian groups of order pq. We also prove that for every nonabelian group of order pq there exist 1?r,s?pq such that μG(r,s)>μZ/pqZ(r,s). 相似文献
5.
Letp be any odd prime number. Letk be any positive integer such that
. LetS = (a
1,a
2,...,a
2p−k
) be any sequence in ℤp such that there is no subsequence of lengthp of S whose sum is zero in ℤp. Then we prove that we can arrange the sequence S as follows:
whereu ≥v,u +v ≥ 2p - 2k + 2 anda -b generates ℤp. This extends a result in [13] to all primesp andk satisfying (p + 1)/4 + 3 ≤k ≤ (p + 1)/3 + 1. Also, we prove that ifg denotes the number of distinct residue classes modulop appearing in the sequenceS in ℤp of length 2p -k (2≤k ≤ [(p + 1)/4]+1), and
, then there exists a subsequence of S of lengthp whose sum is zero in ℤp. 相似文献
(1) |
6.
7.
8.
9.
According to the classical Erd?s-Szekeres theorem, every sufficiently large set of points in general position in the plane contains a large subset in convex position. Parallel to the Erd?s-Hajnal problem in graph-Ramsey theory, we investigate how large such subsets must a configuration contain if it does not have any sub-configuration belonging to a fixed order type. 相似文献
10.
In this paper, under the one-parameter closed planar homothetic motion, a generalization of Holditch Theorem is obtained by using two different line segments (with fixed lengths) whose endpoints move along two different closed curves.This revised version was published online in April 2005 with a corrected missing date string. 相似文献
11.
12.
13.
Li WANG 《Frontiers of Mathematics in China》2012,7(1):125-144
Let Ω be a finite set, and let G be a permutation group on Ω. A subset H of G is called intersecting if for any σ, π ∈ H, they agree on at least one point. We show that a maximal intersecting subset of an irreducible imprimitive reflection group
G(m, p, n) is a coset of the stabilizer of a point in {1, …, n} provided n is sufficiently large. 相似文献
14.
利用微分方程给出了反正切相加定理的一种新证法,该方法可直接确定反正切相加定理中函数ε(x,y)的连续域以及函数在域内的取值. 相似文献
15.
16.
Johan van Benthem 《Logica Universalis》2007,1(1):125-138
We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order
logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference
between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections
with interpolation properties, and the modal invariance theorem.
Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95 相似文献
17.
Peter Borg 《Journal of Combinatorial Theory, Series A》2010,117(5):583-588
A k-signed r-set on[n]={1,…,n} is an ordered pair (A,f), where A is an r-subset of [n] and f is a function from A to [k]. Families A1,…,Ap are said to be cross-intersecting if any set in any family Ai intersects any set in any other family Aj. Hilton proved a sharp bound for the sum of sizes of cross-intersecting families of r-subsets of [n]. Our aim is to generalise Hilton's bound to one for families of k-signed r-sets on [n]. The main tool developed is an extension of Katona's cyclic permutation argument. 相似文献
18.
Marius Radulescu Sorin Radulescu 《Journal of Mathematical Analysis and Applications》2011,382(2):559-564
We discuss the problem of global invertibility of nonlinear maps defined on the finite dimensional Euclidean space via differential tests. We provide a generalization of the Fujisawa-Kuh global inversion theorem and introduce a generalized ratio condition which detects when the pre-image of a certain class of linear manifolds is non-empty and connected. In particular, we provide conditions that also detect global injectivity. 相似文献
19.
Xiong Ping DAI Zuo Ling ZHOU 《数学学报(英文版)》2006,22(1):207-210
Let X be a metrizable space and let φ:R× X → X be a continuous flow on X. For any given {φt}-invariant Borel probability measure, this paper presents a {φt}-invariant Borel subset of X satisfying the requirements of the classical ergodic theorem for the contiImous flow (X, {φt}). The set is more restrictive than the ones in the literature, but it might be more useful and convenient, particularly for non-uniformly hyperbolic systems and skew-product flows. 相似文献
20.