首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
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.  相似文献   

2.
This paper is devoted to construct a family of fifth degree cubature formulae for nn-cube with symmetric measure and nn-dimensional spherically symmetrical region. The formula fornn-cube contains at most n2+5n+3n2+5n+3 points and for nn-dimensional spherically symmetrical region contains only n2+3n+3n2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1n2+3n+1 and n2+n+1n2+n+1 if n=7n=7 respectively, the latter of which is minimal.  相似文献   

3.
Let us fix a function f(n)=o(nlnn)f(n)=o(nlnn) and real numbers 0≤α<β≤10α<β1. We present a polynomial time algorithm which, given a directed graph GG with nn vertices, decides either that one can add at most βnβn new edges to GG so that GG acquires a Hamiltonian circuit or that one cannot add αnαn or fewer new edges to GG so that GG acquires at least e−f(n)n!ef(n)n! Hamiltonian circuits, or both.  相似文献   

4.
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.  相似文献   

5.
The oscillation of solutions of f+Af=0f+Af=0 is discussed by focusing on four separate situations. In the complex case AA is assumed to be either analytic in the unit disc DD or entire, while in the real case AA is continuous either on (−1,1)(1,1) or on (0,∞)(0,). In all situations AA is expected to grow beyond bounds that ensure finite oscillation for all (non-trivial) solutions, and the separation between distinct zeros of solutions is considered.  相似文献   

6.
Let TT be a tree with ss ends and f,gf,g be continuous maps from TT to TT with f°g=g°ff°g=g°f. In this note we show that if there exists a positive integer m≥2m2 such that gcd(m,l)=1gcd(m,l)=1 for any 2≤l≤s2ls and f,gf,g share a periodic point which is a kmkm-periodic point of ff for some positive integer kk, then the topological entropy of f°gf°g is positive.  相似文献   

7.
For a Gaussian process XX and smooth function ff, we consider a Stratonovich integral of f(X)f(X), defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on XX such that the sequence converges in law. This gives a change-of-variable formula in law with a correction term which is an Itô integral of f?f? with respect to a Gaussian martingale independent of XX. The proof uses Malliavin calculus and a central limit theorem from Nourdin and Nualart (2010) [8]. This formula was known for fBm with H=1/6H=1/6 Nourdin et al. (2010) [9]. We extend this to a larger class of Gaussian processes.  相似文献   

8.
This paper investigates two problems related to the determination of critical edges for the minimum cost assignment problem. Given a complete bipartite balanced graph with nn vertices on each part and with costs on its edges, kkMost Vital Edges Assignment consists of determining a set of kk edges whose removal results in the largest increase in the cost of a minimum cost assignment. A dual problem, Min Edge Blocker Assignment, consists of removing a subset of edges of minimum cardinality such that the cost of a minimum cost assignment in the remaining graph is larger than or equal to a specified threshold. We show that kkMost Vital Edges Assignment is NPNP-hard to approximate within a factor c<2c<2 and Min Edge Blocker Assignment is NPNP-hard to approximate within a factor 1.361.36. We also provide an exact algorithm for kkMost Vital Edges Assignment that runs in O(nk+2)O(nk+2). This algorithm can also be used to solve exactly Min Edge Blocker Assignment.  相似文献   

9.
We study boundary value problems of the form -Δu=f-Δu=f on ΩΩ and Bu=gBu=g on the boundary ∂ΩΩ, with either Dirichlet or Neumann boundary conditions, where ΩΩ is a smooth bounded domain in RnRn and the data f,gf,g are distributions  . This problem has to be first properly reformulated and, for practical applications, it is of crucial importance to obtain the continuity of the solution uu in terms of f and g  . For f=0f=0, taking advantage of the fact that uu is harmonic on ΩΩ, we provide four formulations of this boundary value problem (one using nontangential limits of harmonic functions, one using Green functions, one using the Dirichlet-to-Neumann map, and a variational one); we show that these four formulations are equivalent. We provide a similar analysis for f≠0f0 and discuss the roles of f and g, which turn to be somewhat interchangeable in the low regularity case. The weak formulation is more convenient for numerical approximation, whereas the nontangential limits definition is closer to the intuition and easier to check in concrete situations. We extend the weak formulation to polygonal domains using weighted Sobolev spaces. We also point out some new phenomena for the “concentrated loads” at the vertices in the polygonal case.  相似文献   

10.
In this paper, we consider Beta(2−α,α)(2α,α) (with 1<α<21<α<2) and related ΛΛ-coalescents. If T(n)T(n) denotes the length of a randomly chosen external branch of the nn-coalescent, we prove the convergence of nα−1T(n)nα1T(n) when nn tends to ∞, and give the limit. To this aim, we give asymptotics for the number σ(n)σ(n) of collisions which occur in the nn-coalescent until the end of the chosen external branch, and for the block counting process associated with the nn-coalescent.  相似文献   

11.
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence xx over a finite alphabet is ultimately periodic if and only if, for some nn, the number of different factors of length nn appearing in xx is less than n+1n+1. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2d2. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of ZdZd definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉Z;<,+. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension dd and characterize sets of ZdZd definable in 〈Z;<,+〉Z;<,+ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.  相似文献   

12.
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 paper deals with the radially symmetric solutions of ut=Δu+um(x,t)vn(0,t)ut=Δu+um(x,t)vn(0,t), vt=Δv+up(0,t)vq(x,t)vt=Δv+up(0,t)vq(x,t), subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that uu (vv) blows up alone if and only if m>p+1m>p+1 (q>n+1q>n+1), which means that any blow-up is simultaneous if and only if m≤p+1mp+1, q≤n+1qn+1. (ii) Any blow-up is uu (vv) blowing up with vv (uu) remaining bounded if and only if m>p+1m>p+1, q≤n+1qn+1 (m≤p+1mp+1, q>n+1q>n+1). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1m>p+1, q>n+1q>n+1. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model.  相似文献   

15.
We analyze the equilibrium fluctuations of density, current and tagged particle in symmetric exclusion with a slow bond. The system evolves in the one-dimensional lattice and the jump rate is everywhere equal to one except at the slow bond where it is αn−βαnβ, with α>0α>0, β∈[0,+∞]β[0,+] and nn is the scaling parameter. Depending on the regime of ββ, we find three different behaviors for the limiting fluctuations whose covariances are explicitly computed. In particular, for the critical value β=1β=1, starting a tagged particle near the slow bond, we obtain a family of Gaussian processes indexed in αα, interpolating a fractional Brownian motion of Hurst exponent 1/41/4 and the degenerate process equal to zero.  相似文献   

16.
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.  相似文献   

17.
In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed ss-dimensional sequence mm, whose elements are vectors obtained by concatenating dd-dimensional vectors from a low-discrepancy sequence qq with (s−d)(sd)-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0ε>0 the difference of the star discrepancies of the first NN points of mm and qq is bounded by εε with probability at least 1−2exp(−ε2N/2)12exp(ε2N/2) for NN sufficiently large. The authors did not study how large NN actually has to be and if and how this actually depends on the parameters ss and εε. In this note we derive a lower bound for NN, which significantly depends on ss and εε. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first NN points of mm and qq, which holds without any restrictions on NN. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes NN. We compare this bound to other known bounds.  相似文献   

18.
Let RR be a commutative ring with identity. We will say that an RR-module MM satisfies the weak Nakayama property, if IM=MIM=M, where II is an ideal of RR, implies that for any x∈MxM there exists a∈IaI such that (a−1)x=0(a1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if RR is a local ring, then RR is a Max ring if and only if J(R)J(R), the Jacobson radical of RR, is TT-nilpotent if and only if every RR-module satisfies the weak Nakayama property.  相似文献   

19.
20.
Given a Brownian Motion WW, in this paper we study the asymptotic behavior, as ε→0ε0, of the quadratic covariation between f(εW)f(εW) and WW in the case in which ff is not smooth. Among the main features discovered is that the speed of the decay in the case f∈CαfCα is at least polynomial in εε and not exponential as expected. We use a recent representation as a backward–forward Itô integral of [f(εW),W][f(εW),W] to prove an εε-dependent approximation scheme which is of independent interest. We get the result by providing estimates to this approximation. The results are then adapted and applied to generalize the results of Almada Monter and Bakhtin (2011) and Bakhtin (2011) related to the small noise exit from a domain problem for the saddle case.  相似文献   

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

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