共查询到20条相似文献,搜索用时 62 毫秒
1.
Let E be a Banach lattice and F a Banach space. A bounded linear operator T:E→F is an isomorphism on the positive cone of E if and only if T∗ is almost surjective. A dual version of this theorem holds also. A bounded linear operator T:F→E is almost surjective if and only if T∗ is an isomorphism on the positive cone of F∗. 相似文献
2.
If U,V are closed subspaces of a Fréchet space, then E is the direct sum of U and V if and only if E′ is the algebraic direct sum of the annihilators U° and V°. We provide a simple proof of this (possibly well-known) result. 相似文献
3.
We prove that if for a continuous map f on a compact metric space X, the chain recurrent set, R(f) has more than one chain component, then f does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f on a compact metric space X has the asymptotic average shadowing property and if A is an attractor for f, then A is the single attractor for f and we have A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if M is a compact manifold which is not finite with dimM=2, then the C1 interior of the set of all C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω-stable diffeomorphisms. 相似文献
4.
Suppose X is a real q-uniformly smooth Banach space and F,K:X→X are Lipschitz ?-strongly accretive maps with D(K)=F(X)=X. Let u∗ denote the unique solution of the Hammerstein equation u+KFu=0. An iteration process recently introduced by Chidume and Zegeye is shown to converge strongly to u∗. No invertibility assumption is imposed on K and the operators K and F need not be defined on compact subsets of X. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included. 相似文献
5.
Jean-Stéphane Dhersin Fabian Freund Arno Siri-Jégousse Linglong Yuan 《Stochastic Processes and their Applications》2013
In this paper, we consider Beta(2−α,α) (with 1<α<2) and related Λ-coalescents. If T(n) denotes the length of a randomly chosen external branch of the n-coalescent, we prove the convergence of nα−1T(n) when n tends to ∞, and give the limit. To this aim, we give asymptotics for the number σ(n) of collisions which occur in the n-coalescent until the end of the chosen external branch, and for the block counting process associated with the n-coalescent. 相似文献
6.
We show that if T:X→X is a continuous linear operator on an F-space X≠{0}, then the set of frequently hypercyclic vectors of T is of first category in X, and this answers a question of A. Bonilla and K.-G. Grosse-Erdmann. We also show that if T:X→X is a bounded linear operator on a Banach space X≠{0} and if T is frequently hypercyclic (or, more generally, syndetically transitive), then the T∗-orbit of every non-zero element of X∗ is bounded away from 0, and in particular T∗ is not hypercyclic. 相似文献
7.
We consider families of Ehrenfest chains and provide a simple criterion on the Lp-cutoff and the Lp-precutoff with specified initial states for 1≤p<∞. For the family with an Lp-cutoff, a cutoff time is described and a possible window is given. For the family without an Lp-precutoff, the exact order of the Lp-mixing time is determined. The result is consistent with the well-known conjecture on cutoffs of Markov chains proposed by Peres in 2004, which says that a cutoff exists if and only if the multiplication of the spectral gap and the mixing time tends to infinity. 相似文献
8.
It is proved that the solutions to the singular stochastic p-Laplace equation, p∈(1,2) and the solutions to the stochastic fast diffusion equation with nonlinearity parameter r∈(0,1) on a bounded open domain Λ⊂Rd with Dirichlet boundary conditions are continuous in mean, uniformly in time, with respect to the parameters p and r respectively (in the Hilbert spaces L2(Λ), H−1(Λ) respectively). The highly singular limit case p=1 is treated with the help of stochastic evolution variational inequalities, where P-a.s. convergence, uniformly in time, is established. 相似文献
9.
In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε. The cost of the algorithm is polynomial in d and ε−1, while the number of qubits is polynomial in d and logε−1. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1), with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε. The cost of the algorithm is polynomial in d, ε−1 and δ−1, while the number of qubits is polynomial in d, logε−1 and logδ−1. 相似文献
10.
11.
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a′(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. It was conjectured that a′(G)≤Δ+2 for any simple graph G with maximum degree Δ. In this paper, we prove that if G is a planar graph, then a′(G)≤Δ+7. This improves a result by Basavaraju et al. [M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet, T. Müller, Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2011) 463–478], which says that every planar graph G satisfies a′(G)≤Δ+12. 相似文献
12.
Consider a face-to-face parallelohedral tiling of Rd and a (d−k)-dimensional face F of the tiling. We prove that the valence of F (i.e. the number of tiles containing F as a face) is not greater than 2k. If the tiling is affinely equivalent to a Voronoi tiling for some lattice (the so called Voronoi case), this gives a well-known upper bound for the number of vertices of a Delaunay k-cell. Yet we emphasize that such an affine equivalence is not assumed in the proof. 相似文献
13.
Michel Mandjes Petteri Mannersalo Ilkka Norros Miranda van Uitert 《Stochastic Processes and their Applications》2006
Consider events of the form {Zs≥ζ(s),s∈S}, where Z is a continuous Gaussian process with stationary increments, ζ is a function that belongs to the reproducing kernel Hilbert space R of process Z, and S⊂R is compact. The main problem considered in this paper is identifying the function β∗∈R satisfying β∗(s)≥ζ(s) on S and having minimal R-norm. The smoothness (mean square differentiability) of Z turns out to have a crucial impact on the structure of the solution. As examples, we obtain the explicit solutions when ζ(s)=s for s∈[0,1] and Z is either a fractional Brownian motion or an integrated Ornstein–Uhlenbeck process. 相似文献
14.
We study second and fourth order semilinear elliptic equations with a power-type nonlinearity depending on a power p and a parameter λ>0. For both equations we consider Dirichlet boundary conditions in the unit ball B⊂Rn. Regularity of solutions strictly depends on the power p and the parameter λ. We are particularly interested in the radial solutions of these two problems and many of our proofs are based on an ordinary differential equation approach. 相似文献
15.
In this paper, we consider a continuous map f:X→X, where X is a compact metric space, and prove that for any positive integer N, f is Schweizer–Smital chaotic if and only if fN is too. 相似文献
16.
Suppose X is a real q-uniformly smooth Banach space and F,K:X→X are bounded strongly accretive maps with D(K)=F(X)=X. Let u∗ denote the unique solution of the Hammerstein equation u+KFu=0. A new explicit coupled iteration process is shown to converge strongly to u∗. No invertibility assumption is imposed on K and the operators K and F need not be defined on compact subsets of X. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included. 相似文献
17.
Let x(s), s∈Rd be a Gaussian self-similar random process of index H. We consider the problem of log-asymptotics for the probability pT that x(s), x(0)=0 does not exceed a fixed level in a star-shaped expanding domain T⋅Δ as T→∞. We solve the problem of the existence of the limit, θ?lim(−logpT)/(logT)D, T→∞, for the fractional Brownian sheet x(s), s∈[0,T]2 when D=2, and we estimate θ for the integrated fractional Brownian motion when D=1. 相似文献
18.
A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of w-values is finite for a group G∈X, it always follows that w(G) is finite. P. Hall asked whether every word is concise. Due to Ivanov the answer to this problem is known to be negative. Dan Segal asked whether every word is concise in the class of residually finite groups. In this direction we prove that if w is a multilinear commutator and q is a prime-power, then the word wq is indeed concise in the class of residually finite groups. Further, we show that in the case where w=γk the word wq is boundedly concise in the class of residually finite groups. It remains unknown whether the word wq is actually concise in the class of all groups. 相似文献
19.
Let F be either the real number field R or the complex number field C and RPn the real projective space of dimension n. Theorems A and C in Hemmi and Kobayashi (2008) [2] give necessary and sufficient conditions for a given F-vector bundle over RPn to be stably extendible to RPm for every m?n. In this paper, we simplify the theorems and apply them to the tangent bundle of RPn, its complexification, the normal bundle associated to an immersion of RPn in Rn+r(r>0), and its complexification. Our result for the normal bundle is a generalization of Theorem A in Kobayashi et al. (2000) [8] and that for its complexification is a generalization of Theorem 1 in Kobayashi and Yoshida (2003) [5]. 相似文献
20.
Let us fix a function f(n)=o(nlnn) and real numbers 0≤α<β≤1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both. 相似文献