共查询到20条相似文献,搜索用时 27 毫秒
1.
A d-arc-dominated digraph is a digraph D of minimum out-degree d such that for every arc (x,y) of D, there exists a vertex u of D of out-degree d such that (u,x) and (u,y) are arcs of D. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs. 相似文献
2.
Let I=[0,1] and let P be a partition of I into a finite number of intervals. Let τ1, τ2; I→I be two piecewise expanding maps on P . Let G⊂I×I be the region between the boundaries of the graphs of τ1 and τ2. Any map τ:I→I that takes values in G is called a selection of the multivalued map defined by G . There are many results devoted to the study of the existence of selections with specified topological properties. However, there are no results concerning the existence of selection with measure-theoretic properties. In this paper we prove the existence of selections which have absolutely continuous invariant measures (acim). By our assumptions we know that τ1 and τ2 possess acims preserving the distribution functions F(1) and F(2). The main result shows that for any convex combination F of F(1) and F(2) we can find a map η with values between the graphs of τ1 and τ2 (that is, a selection) such that F is the η-invariant distribution function. Examples are presented. We also study the relationship of the dynamics of our multivalued maps to random maps. 相似文献
3.
4.
It is shown that if a sequence of open n-sets Dk increases to an open n-set D then reflected stable processes in Dk converge weakly to the reflected stable process in D for every starting point x in D. The same result holds for censored α-stable processes for every x in D if D and Dk satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains. 相似文献
5.
6.
M. Gürdal 《Expositiones Mathematicae》2009,27(2):153-160
In the present paper we consider the Volterra integration operator V on the Wiener algebra W(D) of analytic functions on the unit disc D of the complex plane C. A complex number λ is called an extended eigenvalue of V if there exists a nonzero operator A satisfying the equation AV=λVA. We prove that the set of all extended eigenvalues of V is precisely the set C?{0}, and describe in terms of Duhamel operators and composition operators the set of corresponding extended eigenvectors of V. The similar result for some weighted shift operator on ?p spaces is also obtained. 相似文献
7.
Let K be a closed convex subset of a q-uniformly smooth separable Banach space, T:K→K a strictly pseudocontractive mapping, and f:K→K an L-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1), let xt be the unique fixed point of tf+(1-t)T. We prove that if T has a fixed point, then {xt} converges to a fixed point of T as t approaches to 0. 相似文献
8.
9.
Let G=(V,E) be a graph. A subset D⊆V is a dominating set if every vertex not in D is adjacent to a vertex in D. A dominating set D is called a total dominating set if every vertex in D is adjacent to a vertex in D. The domination (resp. total domination) number of G is the smallest cardinality of a dominating (resp. total dominating) set of G. The bondage (resp. total bondage) number of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with larger domination (resp. total domination) number of G. The reinforcement (resp. total reinforcement) number of G is the smallest number of edges whose addition to G results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard. 相似文献
10.
11.
In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2, there are finitely many distance-regular graphs Γ with valency k, diameter D≥3 and v vertices satisfying v≤αk unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3, diameter D≥3 and c2≥εk for a given 0<ε<1 unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). 相似文献
12.
13.
In this paper we study families of degree 2 parabolic-like mappings (fλ)λ∈Λ (as defined in [4]). We prove that the hybrid conjugacies between a nice analytic family of degree 2 parabolic-like mappings and members of the family Per1(1) induce a continuous map χ:Λ→C, which under suitable conditions restricts to a ramified covering from the connectedness locus of (fλ)λ∈Λ to the connectedness locus M1?{1} of Per1(1). As an application, we prove that the connectedness locus of the family Ca(z)=z+az2+z3, a∈C presents baby M1. 相似文献
14.
15.
In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X in a bounded κ-fat open set; if u is a positive harmonic function with respect to X in a bounded κ-fat open set D and h is a positive harmonic function in D vanishing on Dc, then the non-tangential limit of u/h exists almost everywhere with respect to the Martin-representing measure of h. 相似文献
16.
A polynomial curve of degree 5, α, is a helix if and only if both ∥α′∥ and ∥α′∧α″∥ are polynomial functions. 相似文献
17.
We show that the equality m1(f(x))=m2(g(x)) for x in a neighborhood of a point a remains valid for all x provided that f and g are open holomorphic maps, f(a)=g(a)=0 and m1,m2 are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between f and g is obtained. 相似文献
18.
Let (W,S) be a Coxeter system with a strictly complete Coxeter graph. The present paper concerns the set Red(z) of all reduced expressions for any z∈W. By associating each bc-expression to a certain symbol, we describe the set Red(z) and compute its cardinal |Red(z)| in terms of symbols. An explicit formula for |Red(z)| is deduced, where the Fibonacci numbers play a crucial role. 相似文献
19.
We study aspects of the analytic foundations of integration and closely related problems for functions of infinitely many variables x1,x2,…∈D. The setting is based on a reproducing kernel k for functions on D, a family of non-negative weights γu, where u varies over all finite subsets of N, and a probability measure ρ on D. We consider the weighted superposition K=∑uγuku of finite tensor products ku of k. Under mild assumptions we show that K is a reproducing kernel on a properly chosen domain in the sequence space DN, and that the reproducing kernel Hilbert space H(K) is the orthogonal sum of the spaces H(γuku). Integration on H(K) can be defined in two ways, via a canonical representer or with respect to the product measure ρN on DN. We relate both approaches and provide sufficient conditions for the two approaches to coincide. 相似文献
20.
Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d be an integer at least 3, and let G be a graph with maximum degree d. If G does not contain Kd+1 as a subgraph, then G has a d-coloring in which one color class has size α(G). Here α(G) denotes the independence number of G. We give a unified proof of Brooks’ theorem and Catlin’s theorem. 相似文献