首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
王见勇 《数学学报》2016,59(4):519-529
讨论赋准范空间的共轭空间的表示问题,研究几个l~0类赋准范空间的共轭空间的表示定理,得到代数表示连等式(l~0)~*(A=)(c~0)~*(A=)(c_0~0)~*(A=)(c_(00)~0)~*(A=)c_(00),与拓扑表示定理((c_(00)~0)~*,sw~*)=c_(00)~0.  相似文献   

2.
In this paper we exhibit a triangular map F of the square with the following properties: (i) F is of type 2 but has positive topological entropy; we recall that similar example was given by Kolyada in 1992, but our argument is much simpler. (ii) F is distributionally chaotic in the wider sense, but not distributionally chaotic in the sense introduced by Schweizer and Smítal [Trans. Amer. Math. Soc. 344 (1994) 737]. In other words, there are lower and upper distribution functions Φxy and Φxy* generated by F such that Φxy*≡1 and Φxy(0+)<1, and no distribution functions Φuv, and Φuv* such that Φuv*≡1 and Φuv(t)=0 whenever 0<t<ε, for some ε>0. We also show that the two notions of distributional chaos used in the paper, for continuous maps of a compact metric space, are invariants of topological conjugacy.  相似文献   

3.
For a positive integer k2, the k-Fibonacci sequence {gn(k)} is defined as: g1(k)==gk−2(k)=0, gk−1(k)=gk(k)=1 and for n>k2, gn(k)=gn−1(k)+gn−2(k)++gnk(k). Moreover, the k-Lucas sequence {ln(k)} is defined as ln(k)=gn−1(k)+gn+k−1(k) for n1. In this paper, we consider the relationship between gn(k) and ln(k) and 1-factors of a bipartite graph.  相似文献   

4.
Let A be a matrix in r×r such that Re(z) > −1/2 for all the eigenvalues of A and let {πn(A,1/2) (x)} be the normalized sequence of Laguerre matrix polynomials associated with A. In this paper, it is proved that πn(A,1/2) (x) = O(n(A)/2lnr−1(n)) and πn+1(A,1/2) (x) − πn(A,1/2) (x) = O(n((A)−1)/2lnr−1(n)) uniformly on bounded intervals, where (A) = max{Re(z); z eigenvalue of A}.  相似文献   

5.
For a 1-dependent stationary sequence {Xn} we first show that if u satisfies p1=p1(u)=P(X1>u)0.025 and n>3 is such that 88np131, then
P{max(X1,…,Xn)u}=ν·μn+O{p13(88n(1+124np13)+561)}, n>3,
where
ν=1−p2+2p3−3p4+p12+6p22−6p1p2,μ=(1+p1p2+p3p4+2p12+3p22−5p1p2)−1
with
pk=pk(u)=P{min(X1,…,Xk)>u}, k1
and
|O(x)||x|.
From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Ys}, a similar, in terms of P{max0skTYs<u}, k=1,2 formula for P{max0stYsu}, t>3T and apply this formula to the process Ys=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.  相似文献   

6.
The paper obtains a functional limit theorem for the empirical process of a stationary moving average process Xt with i.i.d. innovations belonging to the domain of attraction of a symmetric -stable law, 1<<2, with weights bj decaying as j−β, 1<β<2/. We show that the empirical process (normalized by N1/β) weakly converges, as the sample size N increases, to the process cx+L++cxL, where L+,L are independent totally skewed β-stable random variables, and cx+,cx are some deterministic functions. We also show that, for any bounded function H, the weak limit of suitably normalized partial sums of H(Xs) is an β-stable Lévy process with independent increments. This limiting behavior is quite different from the behavior of the corresponding empirical processes in the parameter regions 1/<β<1 and 2/<β studied in Koul and Surgailis (Stochastic Process. Appl. 91 (2001) 309) and Hsing (Ann. Probab. 27 (1999) 1579), respectively.  相似文献   

7.
Biochemical oxygen demand (BOD) is a parameter of prime importance in surface water pollution studies and in the design and operation of waste-water treatment plants. A general, stochastic analytical model (denoted S1) is developed for the temporal expectation and (heteroscedastic) variance of first-order BOD kinetics. The model is obtained by integrating the moment equation, which is derived from the mathematical theory of stochastic differential equations. This model takes into account random initial conditions, random inputs, and random coefficients, which appear in the model formulation as initial condition (σO2), input (σl2), and coefficient (σc2) variance parameters, respectively. By constraining these three variance parameters to either vanish or to be nonnegative, model S1 is allowed (under appropriate combinations of the constraints) to split into six stochastic “submodels” (denoted S2 to S7), with each of these submodels being a particular case of the general model. Model S1 also degenerates to the deterministic model (denoted D) when each of the variance parameters vanish. The deterministic parameters (i.e., the rate coefficient and the ultimate BOD) and the stochastic variance parameters of the seven models are estimated on sets of replicated BOD data using the maximum likelihood principle. In this study, two (S5 and S7) of these seven stochastic models are found to be appropriate for BOD. The stochastic input (S5) model (i.e., null initial condition and coefficient variance parameters) shows the best prediction capabilities, while the next best is the stochastic initial condition (S7) model (i.e., null input and coefficient variance parameters).  相似文献   

8.
Consider the following Itô stochastic differential equation dX(t) = ƒ(θ0, X(t)) dt + dW(t), where (W(t), t 0), is a standard Wiener process in RN. On the basis of discrete data 0 = t0 < t1 < …<tn = T; X(t1),...,X(tn) we would like to estimate the parameter θ0. We shall define the least squares estimator and show that under some regularity conditions, is strongly consistent.  相似文献   

9.
Suppose {k, −∞ < k < ∞} is an independent, not necessarily identically distributed sequence of random variables, and {cj}j=0, {dj}j=0 are sequences of real numbers such that Σjc2j < ∞, Σjd2j < ∞. Then, under appropriate moment conditions on {k, −∞ < k < ∞}, yk Σj=0cjk-j, zk Σj=0djk-j exist almost surely and in 4 and the question of Gaussian approximation to S[t]Σ[t]k=1 (yk zkE{yk zk}) becomes of interest. Prior to this work several related central limit theorems and a weak invariance principle were proven under stationary assumptions. In this note, we demonstrate that an almost sure invariance principle for S[t], with error bound sharp enough to imply a weak invariance principle, a functional law of the iterated logarithm, and even upper and lower class results, also exists. Moreover, we remove virtually all constraints on k for “time” k ≤ 0, weaken the stationarity assumptions on {k, −∞ < k < ∞}, and improve the summability conditions on {cj}j=0, {dj}j=0 as compared to the existing weak invariance principle. Applications relevant to this work include normal approximation and almost sure fluctuation results in sample covariances (let dj = cj-m for jm and otherwise 0), quadratic forms, Whittle's and Hosoya's estimates, adaptive filtering and stochastic approximation.  相似文献   

10.
We partially characterize the rational numbers x and integers n 0 for which the sum ∑k=0 knxk assumes integers. We prove that if ∑k=0 knxk is an integer for x = 1 − a/b with a, b> 0 integers and gcd(a,b) = 1, then a = 1 or 2. Partial results and conjectures are given which indicate for which b and n it is an integer if a = 2. The proof is based on lower bounds on the multiplicities of factors of the Stirling number of the second kind, S(n,k). More specifically, we obtain for all integers k, 2 k n, and a 3, provided a is odd or divisible by 4, where va(m) denotes the exponent of the highest power of a which divides m, for m and a> 1 integers.

New identities are also derived for the Stirling numbers, e.g., we show that ∑k=02nk! S(2n, k) , for all integers n 1.  相似文献   


11.
For the pth-order linear ARCH model,
, where 0 > 0, i 0, I = 1, 2, …, p, {t} is an i.i.d. normal white noise with Et = 0, Et2 = 1, and t is independent of {Xs, s < t}, Engle (1982) obtained the necessary and sufficient condition for the second-order stationarity, that is, 1 + 2 + ··· + p < 1. In this note, we assume that t has the probability density function p(t) which is positive and lower-semicontinuous over the real line, but not necessarily Gaussian, then the geometric ergodicity of the ARCH(p) process is proved under Et2 = 1. When t has only the first-order absolute moment, a sufficient condition for the geometric ergodicity is also given.  相似文献   

12.
We are concerned with the behavior of the minimum (maximum) eigenvalue λ0(n) (λn(n)) of an (n + 1) × (n + 1) Hermitian Toeplitz matrix Tn(ƒ) where ƒ is an integrable real-valued function. Kac, Murdoch, and Szegö, Widom, Parter, and R. H. Chan obtained that λ0(n) — min ƒ = O(1/n2k) in the case where ƒ C2k, at least locally, and ƒ — inf ƒ has a zero of order 2k. We obtain the same result under the second hypothesis alone. Moreover we develop a new tool in order to estimate the extreme eigenvalues of the mentioned matrices, proving that the rate of convergence of λ0(n) to inf ƒ depends only on the order ρ (not necessarily even or integer or finite) of the zero of ƒ — inf ƒ. With the help of this tool, we derive an absolute lower bound for the minimal eigenvalues of Toeplitz matrices generated by nonnegative L1 functions and also an upper bound for the associated Euclidean condition numbers. Finally, these results are extended to the case of Hermitian block Toeplitz matrices with Toeplitz blocks generated by a bivariate integrable function ƒ.  相似文献   

13.
The Curie-Weiss-Potts model, a model in statistical mechanics, is parametrized by the inverse temperature β and the external magnetic field h. This paper studies the asymptotic behavior of the maximum likelihood estimator of the parameter β when h = 0 and the asymptotic behavior of the maximum likelihood estimator of the parameter h when β is known and the true value of h is 0. The limits of these maximum likelihood estimators reflect the phase transition in the model; i.e., different limits depending on whether β < βc, β = βc or β > βc, where βc ε (0, ∞) is the critical inverse temperature of the model.  相似文献   

14.
We construct the polynomial pm,n* of degree m which interpolates a given real-valued function f L2[a, b] at pre-assigned n distinct nodes and is the best approximant to f in the L2-sense over all polynomials of degree m with the same interpolatory character. It is shown that the L2-error pm,n*f → 0 as m → ∞ if f C[a, b].  相似文献   

15.
For an integer n3, the crown Sn0 is defined to be the graph with vertex set {x0,x1,…,xn−1,y0,y1,…,yn−1} and edge set {xiyj: 0i,jn−1, ij}. In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.  相似文献   

16.
17.
Let A be a (0, 1)-matrix of order n 3 and let si0(A), i = 1, …, n, be the number of the off diagonal 0's in row and column i of A. We prove that if A is irreducible, and if all its principal submatrices of order (n − 1) are reducible, then si0(A) n − 1; i = 1, …, n. This establishes the validity of a conjecture by B. Schwarz concerning strongly connected graphs and their primal subgraphs.  相似文献   

18.
Associated to any simplicial complex Δ on n vertices is a square-free monomial ideal IΔ in the polynomial ring A = k[x1, …, xn], and its quotient k[Δ] = A/IΔ known as the Stanley-Reisner ring. This note considers a simplicial complex Δ* which is in a sense a canonical Alexander dual to Δ, previously considered in [1, 5]. Using Alexander duality and a result of Hochster computing the Betti numbers dimk ToriA (k[Δ],k), it is shown (Proposition 1) that these Betti numbers are computable from the homology of links of faces in Δ*. As corollaries, we prove that IΔ has a linear resolution as A-module if and only if Δ* is Cohen-Macaulay over k, and show how to compute the Betti numbers dimk ToriA (k[Δ],k) in some cases where Δ* is wellbehaved (shellable, Cohen-Macaulay, or Buchsbaum). Some other applications of the notion of shellability are also discussed.  相似文献   

19.
Let CFn×n have minimum polynomial m(x). Suppose C is of zero trace and m(x) splits over F. Then, except when n = 2 and m(x) = (x - c)2 or when n = 3 and m(x) = x - c)2 with c ≠ 0, there exist nilpotents A, B ∈ Fn×n such that C = AB - BA.  相似文献   

20.
The parametric resource allocation problem asks to minimize the sum of separable single-variable convex functions containing a parameter λ, Σi = 1ni(xi + λgi(xi)), under simple constraints Σi = 1n xi = M, lixiui and xi: nonnegative integers for i = 1, 2, …, n, where M is a given positive integer, and li and ui are given lower and upper bounds on xi. This paper presents an efficient algorithm for computing the sequence of all optimal solutions when λ is continuously changed from 0 to ∞. The required time is O(GMlog2 n + n log n + n log(M/n)), where G = Σi = 1n ui − Σi = 1n li and an evaluation of ƒi(·) or gi(·) is assumed to be done in constant time.  相似文献   

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

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