共查询到20条相似文献,搜索用时 387 毫秒
1.
<正> 本文涉及Grunbaum一个已被解决的问题. 设K是R~n中的紧致凸体,P是K的一个内点.过P任作K的一条弦C(p),并以C′(p)记平行于C(p)的任意一条弦.|C(p)|和|C′(p)|分别表C(p)与C′(p)的长.令 相似文献
2.
JIA ChaoHua Institute of Mathematics Academy of Mathematics Systems Science Chinese Academy of Sciences Beijing China 《中国科学A辑(英文版)》2009,(5)
Let P be the set of prime numbers and P (n) denote the largest prime factor of integer n > 1. Write C3 = {p1p2p3 : pi ∈ P (i = 1, 2, 3), pi = pj (i = j)}, B3 = {p1p2p3 : pi ∈ P (i = 1, 2, 3), p1 = p2 or p1 = p3 or p2 = p3, but not p1 = p2 = p3}. For n = p1p2p3 ∈ C3 ∪ B3, we define the w function by ω(n) = P (p1 + p2)P (p1 + p3)P (p2 + p3). If there is m ∈ S - C3 ∪ B3 such that ω(m) = n, then we call m S-parent of n. We shall prove that there are infinitely many elements of C3 which have enough C3-parents an... 相似文献
3.
An asymptotic property of the number of spanning trees of double fixed step loop networks 总被引:4,自引:0,他引:4
YONGXUERONG ZHANGFUJI 《高校应用数学学报(英文版)》1997,12(2):233-236
Let T(C(p,1,q))be tbe number of spanning trees of circulant graph C(p,1,q). In this note we show that T(C(p 1,1,q))/T(C(p,1,q))→2,p→ ∞. 相似文献
4.
用P记素数的集合,P(n)表示整数n(〉1)的最大素因子.记C3={p1p2p3:Pi∈P(i=1,2,3),pi≠pj(i≠j)},
B3={p1p2p3:pi∈P(i=1,2,3),p1=p2或p1=p3或p2=p3,但非p1=p2=p3}.
对于礼=p1p2p3∈C3UB3,定义训函数为
w(n)=P(p1+p2)P(p1+p3)P(p2+p3).如果有m∈S∪→C3∪B3,使得w(m)=n,则称m为n的S-亲源.
本文证明:在C3中有无穷多个元,它们有足够多的C3-亲源;在B3中有无穷多个元,它们也有足够多的C3-亲源.本文还证明,在B3中有无穷多个元,它们有足够多的B3-亲源. 相似文献
5.
设C是常数,p(z)与q(z)为多项式,若p(a)=C也使q(a)=C,则记为p9或qp.[1]提出如下猜想: 设p,q为次数大于1的多项式,若p=0q=0 且 p′=1q′=1,则p=q,其中p′为p的导数。 相似文献
6.
7.
《数学的实践与认识》2020,(12)
研究环R{D,C}的一些性质,证明了:1)环R{D,C}是弱拟morphic环当且仅当D是弱拟morphic环且对任意的x∈C,存在y∈C使得Cx=l_C(y).Dx=l_D(y);2)环R{D,C}是EIFP环当且仅当D和C都是EIFP环;3)环S=R{D,C}是左p.p.-环的充分必要条件是环D和C都是左p.p.-环. 相似文献
8.
《高校应用数学学报(英文版)》2010,(4)
Let Γ be a finite simple undirected graph with no isolated vertices. Let p, q be prime numbers with p ≥ q. We complete the classification of the graphs on which a group of order pq acts edge-transitively. The results are the following. If Aut(Γ) contains a subgroup G of order pq that acts edge-transitively on Γ, then Γ is one of the following graphs: (1) pK 1,1 ; (2) pqK 1,1 ; (3) pK q,1 ; (4) qK p,1 (p q); (5) pC q (q 2); (6) qC p (p q); (7) C p (p q = 2); (8) C pq ; (9) (Z p , C) where C = {±rμ | μ∈ Z q } with q 2, q|(p-1) and r ≡ 1 ≡ r q (mod p); (10) K p,1 (p q); (11) a double Cayley graph B(G, C) with C = {1-r μ | μ∈ Z q } and r ≡ 1 ≡ r q (mod p); (12) K pq,1 ; or (13) K p,q . 相似文献
9.
D. H. BOO C. G. PARK 《数学年刊B辑(英文版)》2000,(4)
1. IntroductionGiven a locally compact abelian group G and a multiplier p on G, one can associate tothem the twisted group C*-algebra C*(G, p), which is the universal object for unitary prepresentations of G. C* (Zm, p) is said to be a noncommutative torns of rank m and denotedby A.. The multiplier p determines a subgroup S. of G, called its symmetry group, andthe multiplier p is called totally skew if the symmetry group S. is trivial. And A. is calledcompletely irrational if p is totally… 相似文献
10.
11.
郝建修 《高校应用数学学报(英文版)》2003,18(2):235-242
§ 1 IntroductionThe cutwidth minimization problem for graphs arises from the circuitlayout of VLSIdesigns[1 ] .Chung pointed outthatthe cutwidth often corresponds to the area of the layoutin array layout in VLSI design[2 ] .In the layout models,the cutwidth problem deals withthe number of edges passing over a vertex when all vertices are arranged in a path.For agraph G with vertex set V(G) and edge set E(G) ,a labeling of G is a one-to-one mapping ffrom V(G) to the integers.The cutwid… 相似文献
12.
决定了4p(p是奇素数)阶二面体群的连通3度Cayley图的完全分类,并证明4p阶二面体群不是弱3-CI群,从而否定了C.H.Li关于"所有有限群都是弱3-CI群"的猜想 相似文献
13.
李学文 《数学的实践与认识》2005,35(8):233-238
群G关于S的有向Cayley图X=Cay(G,S)称为pk阶有向循环图,若G是pk阶循环群.利用有限群论和图论的较深刻的结果,对p2阶弧传递(有向)循环图的正规性条件进行了讨论,证明了任一p2阶弧传递(有向)循环图是正规的当且仅当(|Aut(G,S)|,p)=1. 相似文献
14.
15.
The asymptotic properties of the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs are studied.
Let
be a directed circulant graph. Let
and
be the numbers of spanning trees and of Eulerian trails, respectively. Then
Furthermore, their line digraph and iterations are dealt with and similar results are obtained for undirected circulant graphs.
Project partially supported by the National Natural Science Foundation of China (Grant No. 69673042) and by Hong Kong CERG
(HKUST652/95E). 相似文献
16.
17.
18.
19.
Let Г be a G-symmetric graph admitting a nontrivial G-invariant partition
. Let Г
be the quotient graph of Г with respect to
. For each block B ∊
, the setwise stabiliser GB of B in G induces natural actions on B and on the neighbourhood Г
(B) of B in Г
. Let G(B) and G[B] be respectively the kernels of these actions. In this paper we study certain “local actions" induced by G(B) and G[B], such as the action of G[B] on B and the action of G(B) on Г
(B), and their influence on the structure of Г.
Supported by a Discovery Project Grant (DP0558677) from the Australian Research Council and a Melbourne Early Career Researcher
Grant from The University of Melbourne. 相似文献
20.
Classifying cubic symmetric graphs of order 10p or 10p~2 总被引:1,自引:0,他引:1
KWAK Jin Ho 《中国科学A辑(英文版)》2006,49(3)
A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ≥ 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results, all s-regular cubic graphs of order 10p or 10p2 are also classified for each s ≥ 1 and each prime p, of which the proof depends on the classification of finite simple groups. 相似文献