首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let SφP1 be an elliptic fibration on a K3 surface S. Then the composition S[n]πS(n)symnφPn gives an Abelian fibration on S[n]. Let E be the exceptional divisor of π, then symnφ°π(E) is of dimension n?1. We prove the inverse in this Note. To cite this article: B. Fu, C. R. Acad. Sci. Paris, Ser. I 337 (2003).  相似文献   

2.
Let Xi be iidrv's and Sn=X1+X2+…+Xn. When EX21<+∞, by the law of the iterated logarithm (Snn)(n log n)12→0 a.s. for some constants αn. Thus the r.v. Y=supn?1[|Snn|?(δn log n)12]+ is a.s.finite when δ>0. We prove a rate of convergence theorem related to the classical results of Baum and Katz, and apply it to show, without the prior assumption EX21<+∞ that EYh<+∞ if and only if E|X1|2+h[log|X1|]-1<+∞ for 0<h<1 and δ> hE(X1?EX1)2, whereas EYh=+∞ whenever h>0 and 0<δ<hE(X1?EX1)2.  相似文献   

3.
Explicit and asymptotic solutions are presented to the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + min1 ? t ? n(αM(t) + βM(n + 1 ? t)) for the cases (1) α + β < 1, log2αlog2β is rational, and g(n) = δnI. (2) α + β > 1, min(α, β) > 1, log2αlog2β is rational, and (a) g(n) = δn1, (b) g(n) = 1. The general form of this recurrence was studied extensively by Fredman and Knuth [J. Math. Anal. Appl.48 (1974), 534–559], who showed, without actually solving the recurrence, that in the above cases M(n) = Ω(n1 + 1γ), where γ is defined by α + β = 1, and that limn → ∞M(n)n1 + γ does not exist. Using similar techniques, the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + max1 ? t ? n(αM(t) + βM(n + 1 ? t)) is also investigated for the special case α = β < 1 and g(n) = 1 if n is odd = 0 if n is even.  相似文献   

4.
Let V be a set of n points in Rk. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) lk(n) are the extremal values of l(V) defined by lk(n)=max{l(V)|VVnk}, where Vnk={V|V?Rk,|V|=n, d(V)=1}. A set VVnk is “longest” if l(V)=lk(n). In this paper, first some geometrical properties of longest sets in R2 are studied which are used to obtain l2(n) for small n′s, and then asymptotic bounds on lk(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δk(n)=max{δ(V)|VVnk}. It is easily observed that δk(n)=O(n?1k). Hence, ck=lim supn→∞δk(n)n1k exists. It is shown that for all n, ckn?1k≤δk(n), and hence, for all n, lk(n)≥ ckn1?1k. For k=2, this implies that l2(n)≥(π212)14n12, which generalizes an observation of Fejes-Toth that limn→∞l2(n)n?12≥(π212)14. It is also shown that lk(n) ≤ [(3?√3)k(k?1)]nδk(n) + o(n1?1k) ≤ [(3?√3)k(k?1)]n1?1k + o(n1?1k). The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that l2(n)≤(πn2)12 + O(1).  相似文献   

5.
Let Z(Sn;?(x)) denote the polynomial obtained from the cycle index of the symmetric group Z(Sn) by replacing each variable si by f(x1). Let f(x) have a Taylor series with radius of convergence ? of the form f(x)=xk + ak+1xk+1 + ak+2xk+2+? with every a1?0. Finally, let 0<x<1 and let x??. We prove that
limn→∞Z(Sn;?(x))xkn = Πi=1k(1?xi)?ak+1
This limit is used to estimate the probability (for n and p both large) that a point chosen at random from a random p-point tree has degree n + 1. These limiting probabilities are independent of p and decrease geometrically in n, contrasting with the labeled limiting probabilities of 1n!e.In order to prove the main theorem, an appealing generalization of the principle of inclusion and exclusion is presented.  相似文献   

6.
In this paper iterative schemes for approximating a solution to a rectangular but consistent linear system Ax = b are studied. Let A?Cm × nr. The splitting A = M ? N is called subproper if R(A) ? R(M) and R(A1) ?R(M1). Consider the iteration xi = M2Nxi?1 + M2b. We characterize the convergence of this scheme to a solution of the linear system. When A?Rm×nr, monotonicity and the concept of subproper regular splitting are used to determine a necessary and a sufficient condition for the scheme to converge to a solution.  相似文献   

7.
In Rn let Ω denote a Nikodym region (= a connected open set on which every distribution of finite Dirichlet integral is itself in L2(Ω)). The existence of n commuting self-adjoint operators H1,…, Hnin L2(Ω) such that each Hj is a restriction of ?i ββxj (acting in the distribution sense) is shown to be equivalent to the existence of a set Λ ?Rn such that the restrictions to Ω of the functions exp iλjxj form a total orthogonal family in L2(Ω). If it is required, in addition, that the unitary groups generated by H1,…, Hn act multiplicatively on L2(Ω), then this is shown to correspond to the requirement that Λ can be chosen as a subgroup of the additive group Rn. The measurable sets Ω ?Rn (of finite Lebesgue measure) for which there exists a subgroup Λ ?Rn as stated are precisely those measurable sets which (after a correction by a null set) form a system of representatives for the quotient of Rn by some subgroup Γ (essentially the dual of Λ).  相似文献   

8.
The “cylinder conjecture” is to suppose that, if K is a gauge, the critical constants of C(K) = K ×] ? 1, +1 [? Rn+1 and of its basis K ? Rn are equal. The connection with packing constants is studied. The concept of Za(ssenhaus)-packing is introduced. ⊕i=1hG + (i ? 1)a (G a lattice) is a linear h-lattice, ζh′(K), ζh(K), ηh′(K), ηh(K) the maximum density for translates of K by a linear h-lattice if the translates form a Za-packing for ζ, a packing for η, and if this packing is strict for ^. For K a bounded central star body, it is possible to find H with ζ1(C(K)) ≤ 2 ζH′(K). H is precised for K a gauge and for K = Bn. It is proved by Woods' methods that η1(C(B4)) = supi=1, 3, 4, 6,7 ηi(B4); a result of Cleaver is used.  相似文献   

9.
Let M be an n-dimensional manifold supporting a quasi-Anosov diffeomorphism. If n=3 then either M=T3, in which case the diffeomorphisms is Anosov, or else its fundamental group contains a copy of Z6. If n=4 then Π1(M) contains a copy of Z4, provided that the diffeomorphism is not Anosov. To cite this article: J. Rodriguez Hertz et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 321–323.  相似文献   

10.
In this Note we present some results on the existence of radially symmetric solutions for the nonlinear elliptic equation
(1)Mλ,Λ+(D2u)+up=0,u?0inRN.
Here N?3, p>1 and Mλ,Λ+ denotes the Pucci's extremal operators with parameters 0<λ?Λ. The goal is to describe the solution set as function of the parameter p. We find critical exponents 1<ps+<p1+<pp+, that satisfy: (i) If 1<p<p1+ then there is no nontrivial solution of (1). (ii) If p=p1+ then there is a unique fast decaying solution of (1). (iii) If p1<p?pp+ then there is a unique pseudo-slow decaying solution to (1). (iv) If pp+<p then there is a unique slow decaying solution to (1). Similar results are obtained for the operator Mλ,Λ?. To cite this article: P.L. Felmer, A. Quaas, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 909–914.  相似文献   

11.
Let Xj = (X1j ,…, Xpj), j = 1,…, n be n independent random vectors. For x = (x1 ,…, xp) in Rp and for α in [0, 1], let Fj1(x) = αI(X1j < x1 ,…, Xpj < xp) + (1 ? α) I(X1jx1 ,…, Xpjxp), where I(A) is the indicator random variable of the event A. Let Fj(x) = E(Fj1(x)) and Dn = supx, α max1 ≤ Nn0n(Fj1(x) ? Fj(x))|. It is shown that P[DnL] < 4pL exp{?2(L2n?1 ? 1)} for each positive integer n and for all L2n; and, as n → ∞, Dn = 0((nlogn)12) with probability one.  相似文献   

12.
Let A be the Clifford algebra constructed over a quadratic n-dimensional real vector space with orthogonal basis {e1,…, en}, and e0 be the identity of A. Furthermore, let Mk(Ω;A) be the set of A-valued functions defined in an open subset Ω of Rm+1 (1 ? m ? n) which satisfy Dkf = 0 in Ω, where D is the generalized Cauchy-Riemann operator D = ∑i = 0m ei(??xi) and k? N. The aim of this paper is to characterize the dual and bidual of Mk(Ω;A). It is proved that, if Mk(Ω;A) is provided with the topology of uniform compact convergence, then its strong dual is topologically isomorphic to an inductive limit space of Fréchet modules, which in its turn admits Mk(Ω;A) as its dual. In this way, classical results about the spaces of holomorphic functions and analytic functionals are generalized.  相似文献   

13.
We consider the mixed boundary value problem Au = f in Ω, B0u = g0in Γ?, B1u = g1in Γ+, where Ω is a bounded open subset of Rn whose boundary Γ is divided into disjoint open subsets Γ+ and Γ? by an (n ? 2)-dimensional manifold ω in Γ. We assume A is a properly elliptic second order partial differential operator on Ω and Bj, for j = 0, 1, is a normal jth order boundary operator satisfying the complementing condition with respect to A on Γ+. The coefficients of the operators and Γ+, Γ? and ω are all assumed arbitrarily smooth. As announced in [Bull. Amer. Math. Soc.83 (1977), 391–393] we obtain necessary and sufficient conditions in terms of the coefficients of the operators for the mixed boundary value problem to be well posed in Sobolev spaces. In fact, we construct an open subset T of the reals such that, if Ds = {u ? Hs(Ω): Au = 0} then for s ? = 12(mod 1), (B0,B1): Ds → Hs ? 12?) × Hs ? 32+) is a Fredholm operator if and only if s ∈T . Moreover, T = ?xewTx, where the sets Tx are determined algebraically by the coefficients of the operators at x. If n = 2, Tx is the set of all reals not congruent (modulo 1) to some exceptional value; if n = 3, Tx is either an open interval of length 1 or is empty; and finally, if n ? 4, Tx is an open interval of length 1.  相似文献   

14.
The following commutator identity is proved:
[u(S1), v(S)] = [v1(S1), u1(S)]
. Here S is the n by n matrix of the truncated shift operator S = (Γi,i+1), i = 0, 1,…, n ? 1, and u, v are two polynomials of degree not exceeding n. The reciprocal polynomial f;1 of a polynomial f; of degree ?n is defined by f1(z) = znf(1z). The commutator identity is closely related to some properties of the Bezoutian matrix of a pair of polynomials; it is used to obtain the Bezoutian matrix in the form of a simple expression in terms of S and S1. To demonstrate the advantage of this expression, we show how it can be used to obtain simple proofs of some interesting corollaries.  相似文献   

15.
Given an integer k>0, our main result states that the sequence of orders of the groups SLk(Zn) (respectively, of the groups GLk(Zn)) is Cesàro equivalent as n→∞ to the sequence C1(k)nk2?1 (respectively, C2(k)nk2), where the coefficients C1(k) and C2(k) depend only on k; we give explicit formulas for C1(k) and C2(k). This result generalizes the theorem (which was first published by I. Schoenberg) that says that the Euler function ?(n) is Cesàro equivalent to n6π2. We present some experimental facts related to the main result. To cite this article: A.G. Gorinov, S.V. Shadchin, C. R. Acad. Sci. Paris, Ser. I 337 (2003).  相似文献   

16.
Let Σ be a set of n points in the plane. The minimal network for Σ is the tree of shortest total length LM(Σ) whose vertices are exactly the points of S. The Steiner minimal network for Σ is the tree of shortest possible total length LS(Σ) when the vertices are allowed to be any set Σ′ ? Σ. Clearly LS(Σ) ? LM(Σ), since the minimization in LS is over a larger set. It has long been conjectured that, conversely, LS(Σ) ? (3122) LM(Σ), but this has previously been proved only if n = 3. In this paper, among other results, this is proved for n = 4. Unfortunately the proof is sufficiently complicated that immediate generalization to arbitrary n, no matter how desirable, is unlikely.  相似文献   

17.
Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(xi), i = 1(1)2n+1, gives a trigonometric sum of the nth order, S2n+1(x = a0 + ∑jn = 1(ajcos jx + bjsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S2r+1(x) is one that satisfies
abS2r+1(x)S2r′+1(x)dx=0, r′<r
and two other arbitrarily imposable conditions needed to make S2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S4r?1(x). We have
abS4r?1(x)dx=∑j=12rAjS4r?1(xj)
where the nodes xj, j = 1(1)2r, are the zeros of the orthogonal S2r+1(x). It is proven that Aj > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S2r+1(x), xjandAj, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy.  相似文献   

18.
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by G(x, A) := 1n · number {λi: λi ? x} for all real x. Let An for n = 1, 2, … be an n × n matrix, whose entries aik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, R, p) with the same distribution Fa. Suppose that all moments E | a | k, k = 1, 2, … are finite, Ea=0 and E | a | 2. Let
M(A)=σ=1s θσPσ(A,A1)
with complex numbers θσ and finite products Pσ of factors A and A1 (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G0(x) = G1x) + G2(x), where G1 is a step function and G2 is absolutely continuous, such that with probability 1 G(x, M(Ann12)) converges to G0(x) as n → ∞ for all continuity points x of G0. The density g of G2 vanishes outside a finite interval. There are only finitely many jumps of G1. Both, G1 and G2, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples ArA1r, Ar + A1r, ArA1r ± A1rAr, r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form
lim supn→∞i=1ni(n)|2?6An62? 0.8228…
of Schur's inequality for the eigenvalues λi(n) of An holds. Consequently random matrices do not tend to be normal matrices for large n.  相似文献   

19.
Let {Ai} be a family of sets and let S = ∩iAi. By a positional game we shall mean a game played by two players on {Ai}. The players alternately pick elements of S and that player wins who fist has all the elements of one of the Ai. This paper deals with almost disjoint hypergraphs only, i.e., |AiAj| ? 1 if ij. Let M1(n) be the smallest integer for which there is an almost disjoint n-uniform hypergraph |T| = M1(n), so that the first player has a winning strategy. It is shown that limn [M1(n)]1n = 4, which was conjectured by Erdös. The same method is applied to prove a conjecture of Hales and Jewett on r-dimensional tick-tack-toe if r is large enough. Finally we prove that for an arbitrary almost disjoint n-uniform hypergraph the second player has such a strategy that the first player unable to win in his mth move if m < (2 ? ?)n.  相似文献   

20.
Given a set S of positive integers let ZkS(t) denote the number of k-tuples 〈m1, …, mk〉 for which mi ∈ S ? [1, t] and (m1, …, mk) = 1. Also let PkS(n) denote the probability that k integers, chosen at random from S ? [1, n], are relatively prime. It is shown that if P = {p1, …, pr} is a finite set of primes and S = {m : (m, p1pr) = 1}, then ZkS(t) = (td(S))k Πν?P(1 ? 1pk) + O(tk?1) if k ≥ 3 and Z2S(t) = (td(S))2 Πp?P(1 ? 1p2) + O(t log t) where d(S) denotes the natural density of S. From this result it follows immediately that PkS(n) → Πp?P(1 ? 1pk) = (ζ(k))?1 Πp∈P(1 ? 1pk)?1 as n → ∞. This result generalizes an earlier result of the author's where P = ? and S is then the whole set of positive integers. It is also shown that if S = {p1x1prxr : xi = 0, 1, 2,…}, then PkS(n) → 0 as n → ∞.  相似文献   

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

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