首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到16条相似文献,搜索用时 811 毫秒
1.
对于两个不相同的正整数$m$和$n$, 如果满足$\sigma(m)=\sigma(n)=m+n$, 则称之为一对亲和数, 这里$\sigma(n)=\sum_{d|n}d$.本文给出了$f(x,y)=x^{2^{x}}+y^{2^{x}}(x>y\geq{1},(x,y)=1)$不与任何正整数构成亲和数对的结论, 这里$x$,$y$具有不同的奇偶性, 即, 关于$z$的方程$\sigma(f(x,y))=\sigma(z)=f(x,y)+z$不存在正整数解.  相似文献   

2.
阶为$n$的图$G$的圈长分布是序列($c_1,c_2,\ldots,c_n$), 其中$c_i$是图$G$中长为$i$的圈数.本文得到如下结果: 设$A\subseteq E(K_{n,n+7})$,在以下情况, 图 $G$ 由其圈长分布唯一确定.(1) $G=K_{n,n+7}$(n\geq10)$;(2) $G=K_{n,n+7}-A$ $(|A|=1,n\geq12)$;(3)$G=K_{n,n+7}-A$(|A|=2,n\geq14)$;(4)$G=K_{n,n+7}-A$ $(|A|=3  相似文献   

3.
设$(M,\,T)$是一个带有光滑对合$T$的光滑闭流形, $T$在$M$上的不动点集为 $F=\{x\,|\,T(x)=x,\,x\in M\}$, 则$F$为$M$的闭子流形的不交并. 本文证明了: 当$F=P(2m,\,2l+1)\sqcup P(2m,\,2n+1)$时,其中$n>l\geq m,\,m\neq1,\,3$, $(M,\,T)$协边于零.  相似文献   

4.
设$T$, $U$是两个Artin代数, $_U M_T$是$U$-$T$-双模.本文得到了三角矩阵代数$\Lambda=\left({\smallmatrix T&0\\ M&U \endsmallmatrix}\right)$是$(m,n)$-Igusa-Todorov的一个充要条件.我们还研究了$\Lambda$的IT维数.更具体地说,事实证明$$\max\{\ITdim T, \ITdim U\}\leqslant\ITdim \Lambda\leqslant\min\{\max\{\gldim T,\ITdim U\},\max\{\gldim U,\ITdim T\}\}.$$  相似文献   

5.
$A(n,k)$和$P(n,k)$的精确公式   总被引:1,自引:0,他引:1       下载免费PDF全文
设A(n,k)表示不定方程的非负整数解的个数,P(n,k)为整数n分为k个部分的无序分拆的个数,每个分部不小于1.本文给出了A(n,k)和P(n,k)的精确表达式.  相似文献   

6.
直径为d的超环面网的(d,2n)-控制数   总被引:2,自引:0,他引:2  
n维超环面网C(dl,d2,…,dn)定义如下顶点集为{(x1,..,xn)|0≤xi<di(1≤i≤n)};每个顶点(xl,…,xn)与(x1±1,x2,…,xn),(xl,x2±1,…,xn),…,(x1,x2,….,xn±1)这2n个顶点相邻.(d,m)-控制数是用来刻画互连网络数据传输某种模式的一个新参数.本文证明了当d=diam(C(d1,d2,…,dn))时,n维超环面网C(d1,d2,…,dn)≠C(3,3,….,3)的(d,2n)控制数为2(n≥3,di≥3,i∈{1,2,…,n}.  相似文献   

7.
研究$p$-\!\!特征标高度等于$2$的$W(2,\boldsymbol{n})$和$H(2,\boldsymbol{n})$ 的不可约表示, 给出了当 $p$-\!\!特征标$\chi $的 高度等于$2$时, $L=X(2,\boldsymbol{n})$, $X=W,H$ 的不可约$L$-\!\!模 同构类代表元集合.  相似文献   

8.
设$D$是一个非平凡的对称$(v,k,\lambda)$设计, $G$是$D$的一个自同构群.本文证明了如果$G$以二维典型群PSL$(2,q)$作为基柱且在$D$上的作用是旗传递和点本原的,那么设计$D$的参数只能为$(7, 3, 1)$, $(7, 4, 2)$, $(11, 5, 2)$, $(11, 6, 3)$或$(15, 8, 4)$.  相似文献   

9.
研究了$(m,d)$-内射$R$-模作成的类是(预)盖类的条件,证明了$(m,d)$-凝聚环上的每一个左$R$-模都具有$(m,d)$-内射盖.在此基础上,又引入研究了Gorenstein $(m,d)$-平坦模和Gorenstein $(m,d)$-内射模,证明了$(m,d)$-凝聚环上的左$R$-模$M$是Gorenstein$(m,d)$-平坦模的充分必要条件是它的特征模$M^{+}$是Gorenstein $(m,d)$-内射模.推广了Goresntein平坦模和Goresntein $n$-平坦模上的一些结果.  相似文献   

10.
设 $\varphi$ 是单位园盘 $D$ 到自身的解析映射, $X$ 是 $D$ 上解析函数的 Banach 空间, 对 $f\in X$, 定义复合算子$C_\varphi $ : $C_\varphi (f)=f\circ \varphi$. 我们利用从 ${\cal B}^0$到 $E(p,q)$ 和 $E_0(p,q)$ 空间的复合算子研究了空间 $E(p,q)$ 和 $E_0(p,q)$, 给出了一个新的特征.  相似文献   

11.
In this paper, let m, n be two fixed positive integers and M be a right R-module, we define (m, n)-M-flat modules and (m, n)-coherent modules. A right R-module F is called (m, n)-M-flat if every homomorphism from an (n, m)-presented right R-module into F factors through a module in addM. A left S-module M is called an (m, n)-coherent module if MR is finitely presented, and for any (n, m)-presented right R-module K, Hom(K, M) is a finitely generated left S-module, where S = End(MR). We mainly characterize (m, n)-coherent modules in terms of preenvelopes (which are monomorphism or epimorphism) of modules. Some properties of (m, n)-coherent rings and coherent rings are obtained as corollaries.  相似文献   

12.
Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.  相似文献   

13.
The cycle length distribution of a graph G of order n is a sequence (c1 (G),…, cn (G)), where ci (G) is the number of cycles of length i in G. In general, the graphs with cycle length distribution (c1(G) ,…,cn(G)) are not unique. A graph G is determined by its cycle length distribution if the graph with cycle length distribution (c1 (G),…, cn (G)) is unique. Let Kn,n+r be a complete bipartite graph and A lohtaib in E(Kn,n+r). In this paper, we obtain: Let s 〉 1 be an integer. (1) If r = 2s, n 〉 s(s - 1) + 2|A|, then Kn,n+r - A (A lohtain in E(Kn,n+r),|A| ≤ 3) is determined by its cycle length distribution; (2) If r = 2s + 1,n 〉 s^2 + 2|A|, Kn,n+r - A (A lohtain in E(Kn,n+r), |A| ≤3) is determined by its cycle length distribution.  相似文献   

14.
Metric n-Lie algebras have wide applications in mathematics and mathematical physics. In this paper, the authors introduce two methods to construct metric (n+1)-Lie algebras from metric n-Lie algebras for n≥2. For a given m-dimensional metric n-Lie algebra(g, [, ···, ], B_g), via one and two dimensional extensions £=g+IFc and g0= g+IFx~(-1)+IFx~0 of the vector space g and a certain linear function f on g, we construct(m+1)-and (m+2)-dimensional (n+1)-Lie algebras(£, [, ···, ]cf) and(g0, [, ···, ]1), respectively.Furthermore, if the center Z(g) is non-isotropic, then we obtain metric(n + 1)-Lie algebras(L, [, ···, ]cf, B) and(g0, [, ···, ]1, B) which satisfy B|g×g = Bg. Following this approach the extensions of all(n + 2)-dimensional metric n-Lie algebras are discussed.  相似文献   

15.
Let k ≥ 2 be an integer, and let a(n) denote the sum of the positive divisors of an integer n. We call n a quasi-multiperfect number if a(n) = kn + 1. In this paper, we give some necessary properties of quasi-multiperfect numbers with four different prime divisors.  相似文献   

16.
Let k ≥ 2 be an integer, and let σ(n) denote the sum of the positive divisors of an integer n. We call n a quasi-multiperfect number if σ(n) = kn + 1. In this paper, we give some necessary properties of them.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号