首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Let G =(V, E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f* : E → Z2 defined by f*(xy) = f(x) +f(y) for each xy ∈ E. For i ∈ Z2, let vf(i) = |f^-1(i)| and ef(i) = |f*^-1(i)|. A labeling f is called friendly if |vf(1) - vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = e(1) - el(0). The set [if(G) | f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI(G). In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.  相似文献   

2.
Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:VA induces an edge labeling f:EA defined by f(xy)=f(x)+f(y). For iA, let vf(i)=card{vV:f(v)=i} and ef(i)=card{eE:f(e)=i}. A labeling f is said to be A-friendly if |vf(i)−vf(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |ef(i)−ef(j)|≤1 for all (i,j)∈A×A. When A=Z2, the friendly index set of the graph G is defined as {|ef(1)−ef(0)|:the vertex labelingf is Z2-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4).  相似文献   

3.
We study some properties of sets of differences of dense sets in ℤ2 and ℤ3 and their interplay with Bohr neighbourhoods in ℤ. We obtain, inter alia, the following results.
(i)  If E ⊂ ℤ2, $ \bar d $ \bar d (E) > 0 and p i , q i ∈ ℤ[x], i = 1, ..., m satisfy p i (0) = q i (0) = 0, then there exists B ⊂ ℤ such that $ \bar d $ \bar d (B) > 0 and
$ E - E \supset \bigcup\limits_{i = 1}^m {(p_i (B) \times q_i (B))} . $ E - E \supset \bigcup\limits_{i = 1}^m {(p_i (B) \times q_i (B))} .   相似文献   

4.
Letf be a holomorphic self-map of the punctured plane ℂ*=ℂ\{0} with essentially singular points 0 and ∞. In this note, we discuss the setsI 0(f)={z ∈ ℂ*:f n (z) → 0,n → ∞} andI (f)={z ∈ ℂ*:f n (z) → 0,n → ∞}. We try to find the relation betweenI 0(f),I (t) andJ(f). It is proved that both the boundary ofI 0(f) and the boundary ofI )f) equal toJ(f),I 0(f) ∩J(f) ≠ θ andI (f) ∩J(f) ≠ θ. As a consequence of these results, we find bothI 0(f) andI (f) are not doubly-bounded. Supported by the National Natural Science Foundation of China  相似文献   

5.
A three-valued function f: V → {−1, 0, 1} defined on the vertices of a graph G= (V, E) is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every υV, f(N(υ)) ⩾ 1, where N(υ) consists of every vertex adjacent to υ. The weight of an MTDF is f(V) = Σf(υ), over all vertices υV. The minus total domination number of a graph G, denoted γ t (G), equals the minimum weight of an MTDF of G. In this paper, we discuss some properties of minus total domination on a graph G and obtain a few lower bounds for γ t (G).  相似文献   

6.
Let S° be an inverse semigroup with semilattice biordered set E° of idempotents and E a weakly inverse biordered set with a subsemilattice Ep = { e ∈ E | arbieary f ∈ E, S(f , e) loheain in w(e)} isomorphic to E° by θ:Ep→E°. In this paper, it is proved that if arbieary f, g ∈E, f ←→ g→→ f°θD^s° g°θand there exists a mapping φ from Ep into the symmetric weakly inverse semigroup P J(E∪ S°) satisfying six appropriate conditions, then a weakly inverse semigroup ∑ can be constructed in P J(S°), called the weakly inverse hull of a weakly inverse system (S°, E, θ, φ) with I(∑) ≌ S°, E(∑) ∽- E. Conversely, every weakly inverse semigroup can be constructed in this way. Furthermore, a sufficient and necessary condition for two weakly inverse hulls to be isomorphic is also given.  相似文献   

7.
Summary LetK be a compact space andf:K→K a continuous map without fixed points, i.e. Fixf=⊘. For prime numbersp, the sets Fixf p are freeℤ/p-spaces with theℤ/p-action induced byf. Our aim is to estimate the topological indicesi(F p,f) of invariant subsetsF p⊂Fixf p approximating a givenS⊂K. We construct an example (K,f,S) withS⊂Fixf q (q being some prime number) such that, for each neighborhoodU ofS, i (Fix (f|u) p, f) increases linearly withp. This article was processed by the author using the LATEX style filecljour1 from Springer-Verlag.  相似文献   

8.
Abstract. Suppose H is a complex Hilbert space, AH (△) denotes the set of all analytic operator functions on  相似文献   

9.
For an additive subgroup G of a field F of characteristic zero, a Lie algebra B(G) of Block type is defined with basis {Lα,i| α∈G, i∈Z+} and relations [Lα,i, Lβ,j] = (β-α)Lα+β,i+j+(αj-βi)Lα+β,Lα+β,i+j-1.It is proved that an irreducible highest weight B(Z)-module is quasifinite if and only if it is a proper quotient of a Verma module. Furthermore, for a total order λ on G and any ∧∈B(G)0^*(the dual space of B(G)0 = span{L0,i|i∈Z+}), a Verma B(G)-module M(∧,λ) is defined, and the irreducibility of M(A,λ) is completely determined.  相似文献   

10.
Consider the Cauchy problem ∂u(x, t)/∂t = ℋu(x, t) (x∈ℤd, t≥ 0) with initial condition u(x, 0) ≡ 1 and with ℋ the Anderson Hamiltonian ℋ = κΔ + ξ. Here Δ is the discrete Laplacian, κ∈ (0, ∞) is a diffusion constant, and ξ = {ξ(x): x∈ℤ d } is an i.i.d.random field taking values in ℝ. G?rtner and Molchanov (1990) have shown that if the law of ξ(0) is nondegenerate, then the solution u is asymptotically intermittent. In the present paper we study the structure of the intermittent peaks for the special case where the law of ξ(0) is (in the vicinity of) the double exponential Prob(ξ(0) > s) = exp[−e s ] (s∈ℝ). Here θ∈ (0, ∞) is a parameter that can be thought of as measuring the degree of disorder in the ξ-field. Our main result is that, for fixed x, y∈ℤ d and t→∈, the correlation coefficient of u(x, t) and u(y, t) converges to ∥w ρ−2 ℓ2Σz ∈ℤd w ρ(x+z)w ρ(y+z). In this expression, ρ = θ/κ while w ρ:ℤd→ℝ+ is given by w ρ = (v ρ) d with v ρ: ℤ→ℝ+ the unique centered ground state (i.e., the solution in ℓ2(ℤ) with minimal l 2-norm) of the 1-dimensional nonlinear equation Δv + 2ρv log v = 0. The uniqueness of the ground state is actually proved only for large ρ, but is conjectured to hold for any ρ∈ (0, ∞). empty It turns out that if the right tail of the law of ξ(0) is thicker (or thinner) than the double exponential, then the correlation coefficient of u(x, t) and u(y, t) converges to δ x, y (resp.the constant function 1). Thus, the double exponential family is the critical class exhibiting a nondegenerate correlation structure. Received: 5 March 1997 / Revised version: 21 September 1998  相似文献   

11.
Let S be a regular semigroup and E(S) be the set of its idempotents. We call the sets S(e, f)f and eS(e, f) one-sided sandwich sets and characterize them abstractly where e, fE(S). For a, a′ ∈ S such that a = aa′a, a′ = a′aa′, we call S(a) = S(a′a, aa′) the sandwich set of a. We characterize regular semigroups S in which all S(e; f) (or all S(a)) are right zero semigroups (respectively are trivial) in several ways including weak versions of compatibility of the natural order. For every aS, we also define E(a) as the set of all idempotets e such that, for any congruence ϱ on S, aϱa 2 implies that aϱe. We study the restrictions on S in order that S(a) or be trivial. For , we define on S by a b if . We establish for which S are or congruences.  相似文献   

12.
It is shown that every almost linear Pexider mappings f, g, h from a unital C*-algebra into a unital C*-algebra ℬ are homomorphisms when f(2 n uy) = f(2 n u)f(y), g(2 n uy) = g(2 n u)g(y) and h(2 n uy) = h(2 n u)h(y) hold for all unitaries u ∈ , all y ∈ , and all n ∈ ℤ, and that every almost linear continuous Pexider mappings f, g, h from a unital C*-algebra of real rank zero into a unital C*-algebra ℬ are homomorphisms when f(2 n uy) = f(2 n u)f(y), g(2 n uy) = g(2 n u)g(y) and h(2 n uy) = h(2 n u)h(y) hold for all u ∈ {v ∈ : v = v* and v is invertible}, all y ∈ and all n ∈ ℤ. Furthermore, we prove the Cauchy-Rassias stability of *-homomorphisms between unital C*-algebras, and ℂ-linear *-derivations on unital C*-algebras. This work was supported by Korea Research Foundation Grant KRF-2003-042-C00008. The second author was supported by the Brain Korea 21 Project in 2005.  相似文献   

13.
Entropy bounds for perfect matchings and Hamiltonian cycles   总被引:1,自引:1,他引:0  
For a graph G = (V,E) and x: E → ℜ+ satisfying Σ eυ x e = 1 for each υV, set h(x) = Σ e x e log(1/x e ) (with log = log2). We show that for any n-vertex G, random (not necessarily uniform) perfect matching f satisfying a mild technical condition, and x e =Pr(ef),
(where H is binary entropy). This implies a similar bound for random Hamiltonian cycles. Specializing these bounds completes a proof, begun in [6], of a quite precise determination of the numbers of perfect matchings and Hamiltonian cycles in Dirac graphs (graphs with minimum degree at least n/2) in terms of h(G):=maxΣ e x e log(1/x e ) (the maximum over x as above). For instance, for the number, Ψ(G), of Hamiltonian cycles in such a G, we have
. Supported by NSF grant DMS0200856.  相似文献   

14.
A lower bound on the total signed domination numbers of graphs   总被引:4,自引:0,他引:4  
Let G be a finite connected simple graph with a vertex set V(G)and an edge set E(G). A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1}.The weight of f is W(f)=∑_(x∈V)(G)∪E(G))f(X).For an element x∈V(G)∪E(G),we define f[x]=∑_(y∈NT[x])f(y).A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1} such that f[x]≥1 for all x∈V(G)∪E(G).The total signed domination numberγ_s~*(G)of G is the minimum weight of a total signed domination function on G. In this paper,we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values ofγ_s~*(G)when G is C_n and P_n.  相似文献   

15.
16.
17.
Let (Ω,A,μ) be a probability space, K the scalar field R of real numbers or C of complex numbers,and (S,X) a random normed space over K with base (ω,A,μ). Denote the support of (S,X) by E, namely E is the essential supremum of the set {AA: there exists an element p in S such that X p (ω) > 0 for almost all ω in A}. In this paper, Banach-Alaoglu theorem in a random normed space is first established as follows: The random closed unit ball S *(1) = {fS *: X * f ⩽ 1} of the random conjugate space (S *,X *) of (S,X) is compact under the random weak star topology on (S *,X *) iff EA=: {EA | AA} is essentially purely μ-atomic (namely, there exists a disjoint family {A n : nN} of at most countably many μ-atoms from EA such that E = ∪ n=1 A n and for each element F in EA, there is an H in the σ-algebra generated by {A n : nN} satisfying μ(FΔH) = 0), whose proof forces us to provide a key topological skill, and thus is much more involved than the corresponding classical case. Further, Banach-Bourbaki-Kakutani-Šmulian (briefly, BBKS) theorem in a complete random normed module is established as follows: If (S,X) is a complete random normed module, then the random closed unit ball S(1) = {pS: X p ⩽ 1} of (S,X) is compact under the random weak topology on (S,X) iff both (S,X) is random reflexive and EA is essentially purely μ-atomic. Our recent work shows that the famous classical James theorem still holds for an arbitrary complete random normed module, namely a complete random normed module is random reflexive iff the random norm of an arbitrary almost surely bounded random linear functional on it is attainable on its random closed unit ball, but this paper shows that the classical Banach-Alaoglu theorem and BBKS theorem do not hold universally for complete random normed modules unless they possess extremely simple stratification structure, namely their supports are essentially purely μ-atomic. Combining the James theorem and BBKS theorem in complete random normed modules leads directly to an interesting phenomenum: there exist many famous classical propositions that are mutually equivalent in the case of Banach spaces, some of which remain to be mutually equivalent in the context of arbitrary complete random normed modules, whereas the other of which are no longer equivalent to another in the context of arbitrary complete random normed modules unless the random normed modules in question possess extremely simple stratification structure. Such a phenomenum is, for the first time, discovered in the course of the development of random metric theory.  相似文献   

18.
Incompleteness and minimality of complex exponential system   总被引:3,自引:0,他引:3  
A necessary and sufficient condition is obtained for the incompleteness of a complex exponential system E(A,M)in C_α,where C_αis the weighted Banach space consisting of all complex continuous functions f on the real axis R with f(t)exp(-α(t))vanishing at infinity,in the uniform norm‖f‖_α=sup{|f(t)e~(-α(t))|:t∈R}with respect to the weightα(t).If the incompleteness holds, then the complex exponential system E(?)is minimal and each function in the closure of the linear span of complex exponential system E(?)can be extended to an entire function represented by a Taylor-Dirichlet series.  相似文献   

19.
The paper is devoted to the study of a linguistic dynamical system of dimension n ≥ 2 over an arbitrary commutative ring K, i.e., a family F of nonlinear polynomial maps f α : K n K n depending on “time” α ∈ {K − 0} such that f α −1 = f −αM, the relation f α1 (x) = f α2 (x) for some x ∈ Kn implies α1 = α2, and each map f α has no invariant points. The neighborhood {f α (υ)∣α ∈ K − {0}} of an element v determines the graph Γ(F) of the dynamical system on the vertex set Kn. We refer to F as a linguistic dynamical system of rank d ≥ 1 if for each string a = (α1, υ, α2), s ≤ d, where αi + αi+1 is a nonzero divisor for i = 1, υ, d − 1, the vertices υ a = f α1 × ⋯ × f αs (υ) in the graph are connected by a unique path. For each commutative ring K and each even integer n ≠= 0 mod 3, there is a family of linguistic dynamical systems Ln(K) of rank d ≥ 1/3n. Let L(n, K) be the graph of the dynamical system Ln(q). If K = Fq, the graphs L(n, Fq) form a new family of graphs of large girth. The projective limit L(K) of L(n, K), n → ∞, is well defined for each commutative ring K; in the case of an integral domain K, the graph L(K) is a forest. If K has zero divisors, then the girth of K drops to 4. We introduce some other families of graphs of large girth related to the dynamical systems Ln(q) in the case of even q. The dynamical systems and related graphs can be used for the development of symmetric or asymmetric cryptographic algorithms. These graphs allow us to establish the best known upper bounds on the minimal order of regular graphs without cycles of length 4n, with odd n ≥ 3. Bibliography: 42 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 326, 2005, pp. 214–234.  相似文献   

20.
Let A and B be uniform algebras. Suppose that α ≠ 0 and A 1A. Let ρ, τ: A 1A and S, T: A 1B be mappings. Suppose that ρ(A 1), τ(A 1) and S(A 1), T(A 1) are closed under multiplications and contain expA and expB, respectively. If ‖S(f)T(g) − α = ‖ρ(f)τ(g) − α for all f, gA 1, S(e 1)−1S(A 1) and S(e 1) ∈ T(A 1) for some e 1A 1 with ρ(e 1) = 1, then there exists a real-algebra isomorphism $ \tilde S $ \tilde S : AB such that $ \tilde S $ \tilde S (ρ(f)) = S(e 1)−1 S(f) for every fA 1. We also give some applications of this result.  相似文献   

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

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