首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
We show that if T:X→XT:XX is a continuous linear operator on an FF-space X≠{0}X{0}, then the set of frequently hypercyclic vectors of TT is of first category in XX, and this answers a question of A. Bonilla and K.-G. Grosse-Erdmann. We also show that if T:X→XT:XX is a bounded linear operator on a Banach space X≠{0}X{0} and if TT is frequently hypercyclic (or, more generally, syndetically transitive), then the TT-orbit of every non-zero element of XX is bounded away from 0, and in particular TT is not hypercyclic.  相似文献   

2.
It is proved that the cookie-cutter set in RR is structurally instable in C1C1 topology, that means for the invariant set EE of the IFS {fi}i{fi}i, we can always perturb {fi}i{fi}i arbitrarily small in C1C1 topology to provide an IFS {gi}i{gi}i with its invariant set FF, such that dimHE=dimHFdimHE=dimHF and E,FE,F are not Lipschitz equivalent.  相似文献   

3.
We introduce (n+1)(n+1)-preprojective algebras of algebras of global dimension nn. We show that if an algebra is nn-representation-finite then its (n+1)(n+1)-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)(n+1)-preprojective algebra is (n+1)(n+1)-Calabi–Yau, and, more precisely, it is the (n+1)(n+1)-Amiot cluster category of the stable nn-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)(n+1)-cluster tilting object. We show that even if the (n+1)(n+1)-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}n{1,2}) the results above still hold for the stable category of Cohen–Macaulay modules.  相似文献   

4.
Consider a graph GG with a minimal edge cut FF and let G1G1, G2G2 be the two (augmented) components of G−FGF. A long-open question asks under which conditions the crossing number of GG is (greater than or) equal to the sum of the crossing numbers of G1G1 and G2G2—which would allow us to consider those graphs separately. It is known that crossing number is additive for |F|∈{0,1,2}|F|{0,1,2} and that there exist graphs violating this property with |F|≥4|F|4. In this paper, we show that crossing number is additive for |F|=3|F|=3, thus closing the final gap in the question.  相似文献   

5.
Let KK be a closed convex subset of a qq-uniformly smooth separable Banach space, T:K→KT:KK a strictly pseudocontractive mapping, and f:K→Kf:KK an LL-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)t(0,1), let xtxt be the unique fixed point of tf+(1-t)Ttf+(1-t)T. We prove that if TT has a fixed point, then {xt}{xt} converges to a fixed point of TT as tt approaches to 0.  相似文献   

6.
Let CC be a closed convex subset of a real Hilbert space HH and assume that TT is an asymptotically κκ-strict pseudo-contraction on CC with a fixed point, for some 0≤κ<10κ<1. Given an initial guess x0∈Cx0C and given also a real sequence {αn}{αn} in (0, 1), the modified Mann’s algorithm generates a sequence {xn}{xn} via the formula: xn+1=αnxn+(1−αn)Tnxnxn+1=αnxn+(1αn)Tnxn, n≥0n0. It is proved that if the control sequence {αn}{αn} is chosen so that κ+δ<αn<1−δκ+δ<αn<1δ for some δ∈(0,1)δ(0,1), then {xn}{xn} converges weakly to a fixed point of TT. We also modify this iteration method by applying projections onto suitably constructed closed convex sets to get an algorithm which generates a strongly convergent sequence.  相似文献   

7.
In this paper, we give some necessary and sufficient conditions for the existence of Re-nnd and nonnegative definite {1,3}{1,3}- and {1,4}{1,4}-inverses of a matrix A∈Cn×nACn×n and completely described these sets. Moreover, we prove that the existence of nonnegative definite {1,3}{1,3}-inverse of a matrix A   is equivalent with the existence of its nonnegative definite {1,2,3}{1,2,3}-inverse and present the necessary and sufficient conditions for the existence of Re-nnd {1,3,4}{1,3,4}-inverse of A.  相似文献   

8.
Let CC be a nonempty subset of a topological vector space EE. We state and prove new various fixed point theorems of Fan–Browder type for set-valued maps F:C→2EF:C2E such that C⊂F(C)CF(C) (called expansive), without assuming that the sets CC and F(C)F(C) are convex or compact or equal, and EE is Hausdorff. Let KK be a convex subset of EE and let CC be a nonempty subset of KK. Our proofs use a technique based on the investigations of the images of maps and restated for maps f:C×K→R∪{−∞,+∞}f:C×KR{,+} of G.X.-Z. Yuan’s results concerning the existence of equilibrium points and minimax inequalities for maps f:K×K→R∪{−∞,+∞}f:K×KR{,+}. Examples are provided.  相似文献   

9.
In this paper we give the complete answer to a question posed by A. Arhangel?skii and prove that the sphere SnSn is diagonal resolvable if and only if SnSn is an H  -space if and only if n∈{0,1,3,7}n{0,1,3,7}. Moreover, we prove that any upper half even dimensional QQ-sphere cannot be diagonal resolvable.  相似文献   

10.
In 1994 Dias da Silva and Hamidoune solved a long-standing open problem of Erd?s and Heilbronn using the structure of cyclic spaces for derivatives on Grassmannians and the representation theory of symmetric groups. They proved that for any subset AA of the pp-element group Z/pZZ/pZ (where pp is a prime), at least min{p,m|A|−m2+1}min{p,m|A|m2+1} different elements of the group can be written as the sum of mm different elements of AA. In this note we present an easily accessible simplified version of their proof for the case m=2m=2, and explain how the method can be applied to obtain the corresponding inverse theorem.  相似文献   

11.
In a rapidly growing population one expects that two individuals chosen at random from the nnth generation are unlikely to be closely related if nn is large. In this paper it is shown that for a broad class of rapidly growing populations this is not the case. For a Galton–Watson branching process with an offspring distribution {pj}{pj} such that p0=0p0=0 and ψ(x)=jpjI{jx}ψ(x)=jpjI{jx} is asymptotic to x−αL(x)xαL(x) as x→∞x where L(⋅)L() is slowly varying at ∞ and 0<α<10<α<1 (and hence the mean m=∑jpj=∞m=jpj=) it is shown that if XnXn is the generation number of the coalescence of the lines of descent backwards in time of two randomly chosen individuals from the nnth generation then n−XnnXn converges in distribution to a proper distribution supported by N={1,2,3,…}N={1,2,3,}. That is, in such a rapidly growing population coalescence occurs in the recent past rather than the remote past. We do show that if the offspring mean mm satisfies 1<m≡∑jpj<∞1<mjpj< and p0=0p0=0 then coalescence time XnXn does converge to a proper distribution as n→∞n, i.e., coalescence does take place in the remote past.  相似文献   

12.
We consider the Mosco convergence of the sets of fixed points for one-parameter strongly continuous semigroups of nonexpansive mappings. One of our main results is the following: Let CC be a closed convex subset of a Hilbert space EE. Let {T(t):t≥0}{T(t):t0} be a strongly continuous semigroup of nonexpansive mappings on CC. The set of all fixed points of T(t)T(t) is denoted by F(T(t))F(T(t)) for each t≥0t0. Let ττ be a nonnegative real number and let {tn}{tn} be a sequence in RR satisfying τ+tn≥0τ+tn0 and tn≠0tn0 for n∈NnN, and limntn=0limntn=0. Then {F(T(τ+tn))}{F(T(τ+tn))} converges to ?t0F(T(t))?t0F(T(t)) in the sense of Mosco.  相似文献   

13.
We consider the chromatic number of a family of graphs we call box graphs, which arise from a box complex in nn-space. It is straightforward to show that any box graph in the plane has an admissible coloring with three colors, and that any box graph in nn-space has an admissible coloring with n+1n+1 colors. We show that for box graphs in nn-space, if the lengths of the boxes in the corresponding box complex take on no more than two values from the set {1,2,3}{1,2,3}, then the box graph is 33-colorable, and for some graphs three colors are required. We also show that box graphs in 3-space which do not have cycles of length four (which we call “string complexes”) are 33-colorable.  相似文献   

14.
The sum–product conjecture of Erd?s and Szemerédi states that, given a finite set AA of positive numbers, one can find asymptotic lower bounds for max{|A+A|,|A⋅A|}max{|A+A|,|AA|} of the order of |A|1+δ|A|1+δ for every δ<1δ<1. In this paper we consider the set of all spectral radii of n×nn×n matrices with entries in AA, and find lower bounds for the cardinality of this set. In the case n=2n=2, this cardinality is necessarily larger than max{|A+A|,|A⋅A|}max{|A+A|,|AA|}.  相似文献   

15.
Consider events of the form {Zs≥ζ(s),s∈S}{Zsζ(s),sS}, where ZZ is a continuous Gaussian process with stationary increments, ζζ is a function that belongs to the reproducing kernel Hilbert space RR of process ZZ, and S⊂RSR is compact. The main problem considered in this paper is identifying the function β∈RβR satisfying β(s)≥ζ(s)β(s)ζ(s) on SS and having minimal RR-norm. The smoothness (mean square differentiability) of ZZ turns out to have a crucial impact on the structure of the solution. As examples, we obtain the explicit solutions when ζ(s)=sζ(s)=s for s∈[0,1]s[0,1] and ZZ is either a fractional Brownian motion or an integrated Ornstein–Uhlenbeck process.  相似文献   

16.
17.
We prove that if for a continuous map ff on a compact metric space XX, the chain recurrent set, R(f)R(f) has more than one chain component, then ff does not satisfy the asymptotic average shadowing property. We also show that if a continuous map ff on a compact metric space XX has the asymptotic average shadowing property and if AA is an attractor for ff, then AA is the single attractor for ff and we have A=R(f)A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if MM is a compact manifold which is not finite with dimM=2dimM=2, then the C1C1 interior of the set of all C1C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of ΩΩ-stable diffeomorphisms.  相似文献   

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

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