共查询到18条相似文献,搜索用时 200 毫秒
1.
2.
3.
本文证明了当n为奇数且(n,t+1)=1时,如果集合M={ni-1|i=1,2,…,t+1},N={(t+1)j|j=0,1,…,n-1}满足M∩N≠?时,图Cn+Kt是和谐图.从而推广了M.Keid的结果:Cn+K2是和谐图. 相似文献
4.
Let Lp be the function space consisting of periodic functions f(t)with period 2π and f (t) be p-summable on a period, F2π-1 be the set of all trigonometric polynomials of degree相似文献
5.
6.
8.
9.
本文研究了环Fp+vFp上互补对偶(1-2v)-常循环码.利用环Fp+vFp上(1-2v)-常循环码的分解式C=vC1-v ⊕(1-v)Cv,得到了环Fp+vFp上互补对偶(1-2v)-常循环码的生成多项式.然后借助从Fp+vFp到Fp2的Gray映射,证明了环Fp+vFp上互补对偶(1-2v)-常循环码的Gray像是Fp的互补对偶循环码. 相似文献
10.
对于一个有限简单图G,λKv的G-设计(G-填充,G-覆盖),记为(v,G,λ)-GD((v,G,λ)-PD,(v,G,λ)-CD),是一个(X,B),其中X是Kv的顶点集,B是Kv的子图族,每个子图(称为区组)均同构于G,且Kv中任一边都恰好(最多,至少)出现在B的λ个区组中.一个填充(覆盖)设计称为是最大(最小)的,如果没有其它的这种填充(覆盖)设计具有更多(更少)的区组.本文对于λ>1确定了(v,K2,3,λ)-GD的存在谱,并对任意λ构造了λKv的最大K2,3-填充设计和最小K2,3-覆盖设计. 相似文献
11.
A. Kopotowski M G. Nadkarni K. P. S. Bhaskara Rao 《Proceedings Mathematical Sciences》2003,113(1):77-86
We discuss subsetsS of ℝn such that every real valued functionf onS is of the formf(x1, x2, ..., xn) =u
1(x1) +u
2(x2) +...+u
n(xn), and the related concepts and situations in analysis. 相似文献
12.
We previously introduced and analyzed the G
t
/M
t
/s
t
+GI
t
many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing
model when there are many servers and the system experiences periods of overload. In this paper, we establish an asymptotic
loss of memory (ALOM) property for that fluid model, i.e., we show that there is asymptotic independence from the initial
conditions as time t evolves, under regularity conditions. We show that the difference in the performance functions dissipates over time exponentially
fast, again under the regularity conditions. We apply ALOM to show that the stationary G/M/s+GI fluid queue converges to steady state and the periodic G
t
/M
t
/s
t
+GI
t
fluid queue converges to a periodic steady state as time evolves, for all finite initial conditions. 相似文献
13.
V. A. Belonogov 《Proceedings of the Steklov Institute of Mathematics》2009,264(Z1):60-71
In the author’s previous paper, the hypothesis that the alternating groups A
n
have no pairs of semiproportional irreducible characters is reduced to a hypothesis concerning the problem of describing
the pairs of irreducible characters of the symmetric group S
n
that are semiproportional on one of the sets A
n
or S
n
∖A
n
. In this hypothesis, properties of such a pair of characters are expressed in terms of Young’s diagrams corresponding to
these characters. The theorem proved in this paper allows one to exclude from consideration some stages of the verification
of this hypothesis. 相似文献
14.
Yang Li Guohui Cao Ruifei Duan Guangcan Che Zhongxian Zhao J. A. Larrea J E. M. Baggio-Saitovitch 《中国科学A辑(英文版)》2000,43(4):400-406
119Sn M?ssbauer research is carried out on (La1-xSrx),Cu1-xSnxO4(x = 0.075 and 0.110) superconductors which are designed under a new concept. The M?ssbauer spectra results show that Sn occupies
Cu position in Sn4+ state, and there is no Sn2+ ion occupying La position. The local lattice deformation near Sn4+ site is small, but displays an increasing tendency with Sn doping. For La2CuO4 matrix, the simultaneous dopings of Sr/Sn induce holes and electrons on CuO2 layer in a new mechanism which influences superconductivity. Under a new mechanism of extra oxygen, the extra oxygen effect
of Sn-doping on superconductivity is discussed 相似文献
15.
For fixed generalized reflection matrix P, i.e. P
T
= P, P
2 = I, then matrix X is said to be generalized bisymmetric, if X = X
T
= PXP. In this paper, an iterative method is constructed to find the generalized bisymmetric solutions of the matrix equation A
1
X
1
B
1 + A
2
X
2
B
2 + ⋯ + A
l
X
l
B
l
= C where [X
1,X
2, ⋯ ,X
l
] is real matrices group. By this iterative method, the solvability of the matrix equation can be judged automatically. When
the matrix equation is consistent, for any initial generalized bisymmetric matrix group , a generalized bisymmetric solution group can be obtained within finite iteration steps in the absence of roundoff errors,
and the least norm generalized bisymmetric solution group can be obtained by choosing a special kind of initial generalized
bisymmetric matrix group. In addition, the optimal approximation generalized bisymmetric solution group to a given generalized
bisymmetric matrix group in Frobenius norm can be obtained by finding the least norm generalized bisymmetric solution group of the new matrix equation
, where . Given numerical examples show that the algorithm is efficient.
Research supported by: (1) the National Natural Science Foundation of China (10571047) and (10771058), (2) Natural Science
Foundation of Hunan Province (06JJ2053), (3) Scientific Research Fund of Hunan Provincial Education Department(06A017). 相似文献
16.
Charles A. Weibel 《Journal of Pure and Applied Algebra》1980,18(3):333-345
In this note is given an explicit computation method to decide about the minimality of a word in the free group of rank two. A cohomological use of this method is to yield words defining one relator duality groups. 相似文献
17.
The crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to be n. 相似文献
18.
E. I. Bunina 《Journal of Mathematical Sciences》2010,169(5):589-613
In this paper, we prove that every automorphism of a Chevalley group of type B
l
, l ≥ 2, over a commutative local ring with 1/2 is standard, i.e., it is a composition of ring, inner, and central automorphisms. 相似文献