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

2.
The determination of an approximate greatest common divisor (GCD) of two inexact polynomials f=f(y)f=f(y) and g=g(y)g=g(y) arises in several applications, including signal processing and control. This approximate GCD can be obtained by computing a structured low rank approximation S*(f,g)S*(f,g) of the Sylvester resultant matrix S(f,g)S(f,g). In this paper, the method of structured total least norm (STLN) is used to compute a low rank approximation of S(f,g)S(f,g), and it is shown that important issues that have a considerable effect on the approximate GCD have not been considered. For example, the established works only yield one matrix S*(f,g)S*(f,g), and therefore one approximate GCD, but it is shown in this paper that a family of structured low rank approximations can be computed, each member of which yields a different approximate GCD. Examples that illustrate the importance of these and other issues are presented.  相似文献   

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

4.
We show that the equality m1(f(x))=m2(g(x))m1(f(x))=m2(g(x)) for xx in a neighborhood of a point aa remains valid for all xx provided that ff and gg are open holomorphic maps, f(a)=g(a)=0f(a)=g(a)=0 and m1,m2m1,m2 are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between ff and gg is obtained.  相似文献   

5.
6.
In this paper, we study degenerate CR embeddings ff of a strictly pseudoconvex hypersurface M⊂Cn+1MCn+1 into a sphere SS in a higher dimensional complex space CN+1CN+1. The degeneracy of the mapping ff will be characterized in terms of the ranks of the CR second fundamental form and its covariant derivatives. In 2004, the author, together with X. Huang and D. Zaitsev, established a rigidity result for CR embeddings ff into spheres in low codimensions. A key step in the proof of this result was to show that degenerate mappings are necessarily contained in a complex plane section of the target sphere (partial rigidity). In the 2004 paper, it was shown that if the total rank dd of the second fundamental form and all of its covariant derivatives is <n<n (here, nn is the CR dimension of MM), then f(M)f(M) is contained in a complex plane of dimension n+d+1n+d+1. The converse of this statement is also true, as is easy to see. When the total rank dd exceeds nn, it is no longer true, in general, that f(M)f(M) is contained in a complex plane of dimension n+d+1n+d+1, as can be seen by examples. In this paper, we carry out a systematic study of degenerate CR mappings into spheres. We show that when the ranks of the second fundamental form and its covariant derivatives exceed the CR dimension nn, then partial rigidity may still persist, but there is a “defect” kk that arises from the ranks exceeding nn such that f(M)f(M) is only contained in a complex plane of dimension n+d+k+1n+d+k+1. Moreover, this defect occurs in general, as is illustrated by examples.  相似文献   

7.
Let HH be a multigraph, possibly with loops, and consider a set S⊆V(H)SV(H). A (simple) graph GG is (H,S)(H,S)-semi-linked   if, for every injective map f:S→V(G)f:SV(G), there exists an injective map g:V(H)?S→V(G)?f(S)g:V(H)?SV(G)?f(S) and a set of |E(H)||E(H)| internally disjoint paths in GG connecting pairs of vertices of  f(S)∪g(V(H)?S)f(S)g(V(H)?S) for every edge between the corresponding vertices of HH. This new concept of (H,S)(H,S)-semi-linkedness is a generalization of HH-linkedness  . We establish a sharp minimum degree condition for a sufficiently large graph GG to be (H,S)(H,S)-semi-linked.  相似文献   

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

9.
An automatic quadrature method is presented for approximating fractional derivative Dqf(x)Dqf(x) of a given function f(x)f(x), which is defined by an indefinite integral involving f(x)f(x). The present method interpolates f(x)f(x) in terms of the Chebyshev polynomials in the range [0, 1] to approximate the fractional derivative Dqf(x)Dqf(x) uniformly for 0≤x≤10x1, namely the error is bounded independently of xx. Some numerical examples demonstrate the performance of the present automatic method.  相似文献   

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

12.
In this paper, we consider a continuous map f:X→Xf:XX, where XX is a compact metric space, and prove that for any positive integer NN, ff is Schweizer–Smital chaotic if and only if fNfN is too.  相似文献   

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

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

15.
Let kk be any field, GG be a finite group acting on the rational function field k(xg:g∈G)k(xg:gG) by h⋅xg=xhghxg=xhg for any h,g∈Gh,gG. Define k(G)=k(xg:g∈G)Gk(G)=k(xg:gG)G. Noether’s problem asks whether k(G)k(G) is rational (= purely transcendental) over kk. A weaker notion, retract rationality introduced by Saltman, is also very useful for the study of Noether’s problem. We prove that, if GG is a Frobenius group with abelian Frobenius kernel, then k(G)k(G) is retract kk-rational for any field kk satisfying some mild conditions. As an application, we show that, for any algebraic number field kk, for any Frobenius group GG with Frobenius complement isomorphic to SL2(F5)SL2(F5), there is a Galois extension field KK over kk whose Galois group is isomorphic to GG, i.e. the inverse Galois problem is valid for the pair (G,k)(G,k). The same result is true for any non-solvable Frobenius group if k(ζ8)k(ζ8) is a cyclic extension of kk.  相似文献   

16.
17.
The author deals with the quasilinear parabolic equation ut=[uα+g(u)]Δu+buα+1+f(u,∇u)ut=[uα+g(u)]Δu+buα+1+f(u,u) with Dirichlet boundary conditions in a bounded domain ΩΩ, where ff and gg are lower-order terms. He shows that, under suitable conditions on ff and gg, whether the solution is bounded or blows up in a finite time depends only on the first eigenvalue of −ΔΔ in ΩΩ with Dirichlet boundary condition. For some special cases, the result is sharp.  相似文献   

18.
A subset SS of vertices in a graph G=(V,E)G=(V,E) is a connected dominating set of GG if every vertex of V?SV?S is adjacent to a vertex in SS and the subgraph induced by SS is connected. The minimum cardinality of a connected dominating set of GG is the connected domination number γc(G)γc(G). The girth g(G)g(G) is the length of a shortest cycle in GG. We show that if GG is a connected graph that contains at least one cycle, then γc(G)≥g(G)−2γc(G)g(G)2, and we characterize the graphs obtaining equality in this bound. We also establish various upper bounds on the connected domination number of a graph, as well as Nordhaus–Gaddum type results.  相似文献   

19.
We estimate a median of f(Xt)f(Xt) where ff is a Lipschitz function, XX is a Lévy process and tt is an arbitrary time. This leads to concentration inequalities for f(Xt)f(Xt). In turn, corresponding fluctuation estimates are obtained under assumptions typically satisfied if the process has a regular behavior in small time and a, possibly different, regular behavior in large time.  相似文献   

20.
This paper investigates the solvability of discrete Dirichlet boundary value problems by the lower and upper solution method. Here, the second-order difference equation with a nonlinear right hand side ff is studied and f(t,u,v)f(t,u,v) can have a superlinear growth both in uu and in vv. Moreover, the growth conditions on ff are one-sided. We compute a priori bounds on solutions to the discrete problem and then obtain the existence of at least one solution. It is shown that solutions of the discrete problem will converge to solutions of ordinary differential equations.  相似文献   

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

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