共查询到10条相似文献,搜索用时 62 毫秒
1.
Abstract
Thom–Pontrjagin constructions are used to give a
computable necessary and sufficient condition for a homomorphism ϕ
: H
n
(L;Z) → H
n
(M;Z) to be realized by a map
f : M → L of degree k for closed (n − 1)-connected 2n-manifolds M and L,
n > 1. A corollary is that
each (n − 1)-connected
2n-manifold admits selfmaps
of degree larger than 1, n
> 1.
In the most interesting case of dimension 4, with the
additional surgery arguments we give a necessary and sufficient
condition for the existence of a degree k map from a closed orientable
4-manifold M to a closed
simply connected 4-manifold L
in terms of their intersection forms; in particular, there is a
map f :
M → L of degree 1 if and only if the
intersection form of L is
isomorphic to a direct summand of that of
M.
Both authors are supported by MSTC, NSFC. The
comments of F. Ding, J. Z. Pan, Y. Su and the referee enhance
the quality of the paper 相似文献
2.
Erik A. van Doorn 《TOP》2011,19(2):336-350
We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of
convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N. 相似文献
3.
4.
David D. W. Yao M. L. Chaudhry J. G. C. Templeton 《The Journal of the Operational Research Society》1984,35(11):1027-1030
It is proved in this note that the delay in the queue GI X /G/1 can be expressed as the sum of two independent components, such that known results of the queue GI/G/1 (e.g. approximations) can be readily applied. Based on this result, closed-form expressions are also derived for other performance measures of interest. 相似文献
5.
Given a graph G and a finite set T of non-negative integers containing zero, a T-coloring of G is a non-negative integer function f defined on V(G) such that \(|f(x)-f(y)|\not \in T\) whenever \((x,y)\in E(G)\). The span of T-coloring is the difference between the largest and smallest colors, and the T-span of G is the minimum span over all T-colorings f of G. The edge span of a T-coloring is the maximum value of \(|f(x)-f(y)|\) over all edges \((x,y)\in E(G)\), and the T-edge span of G is the minimum edge span over all T-colorings f of G. In this paper, we compute T-span and T-edge span of crown graph, circular ladder and mobius ladder, generalized theta graph, series-parallel graph and wrapped butterfly network. 相似文献
6.
This paper identifies a certain class of locally supersoluble groups (called soluble hall-T groups) which contains the soluble T-groups as well as the nilpotent groups. The main result states that the product of a normal soluble hall-T subgroup and a subnormal locally supersoluble subgroup is always locally supersoluble.AMS Subject Classification (1991): 20E25, 20F16, 20F19 相似文献
7.
In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ
s
(f
2, f
2, …, f
n
) of the Lie group Sp(n), corresponding to the representation with label (f
1, f
2, ..., f
n
), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f
1, f
2, …, f
n
are all even. 相似文献
8.
M. V. Cromie M. L. Chaudhry W. K. Grassmann 《The Journal of the Operational Research Society》1979,30(8):755-763
For the multi-channel bulk-arrival queue, M x /M/c, Abol'nikov and Kabak independently obtained steady state results. In this paper the results of these authors are extended, corrected and simplified. A number of measures of efficiency are calculated for three cases where the arrival group size has: (i) a constant value, (ii) a geometric distribution, or (iii) a positive Poisson distribution. The paper also shows how to calculate fractiles for both the queue length and the waiting time distribution. Examples of extensive numerical results for certain measures of efficiency are presented in tabular and chart form. 相似文献
9.
Dieter Fiems Stijn De Vuyst Sabine Wittevrongel Herwig Bruneel 《Annals of Operations Research》2009,170(1):113-131
In this contribution we investigate higher-order loss characteristics for M/G/1/N queueing systems. We focus on the lengths of the loss and non-loss periods as well as on the number of arrivals during these
periods. For the analysis, we extend the Markovian state of the queueing system with the time and number of admitted arrivals
since the instant where the last loss occurred. By combining transform and matrix techniques, expressions for the various
moments of these loss characteristics are found. The approach also yields expressions for the loss probability and the conditional
loss probability. Some numerical examples then illustrate our results. 相似文献
10.
Let X be a Banach space, K be a scattered compact and T: B
C(K) → X be a Fréchet smooth operator whose derivative is uniformly continuous. We introduce the smooth biconjugate T**: B
C(K)** → X** and prove that if T is noncompact, then the derivative of T** at some point is a noncompact linear operator. Using this we conclude, among other things, that either
is compact or that ℓ1 is a complemented subspace of X*. We also give some relevant examples of smooth functions and operators, in particular, a C
1,u
-smooth noncompact operator from B
c
O which does not fix any (affine) basic sequence.
P. Hájek was supported by grants A100190502, Institutional Research Plan AV0Z10190503. 相似文献