Powerful alliances in graphs

For a graph G=(V,E), a non-empty set S⊆V is a defensive alliance if for every vertex v in S, v has at most one more neighbor in V−S than it has in S, and S is an offensive alliance if for every v∈V−S that has a neighbor in S, v has more neighbors in S than in V−S. A powerful alliance is both defensive and offensive. We initiate the study of powerful alliances in graphs.     

Generalized 3G theorem and application to relativistic stable process on non-smooth open sets

Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes.     

Cubic planar hamiltonian graphs of various types

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G-v is hamiltonian for any vertex v of G, B the set of graphs G in U such that G-e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets A,B, and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets.     

Normality criteria of meromorphic functions with multiple zeros

Take positive integers n,k?2. Let F be a family of meromorphic functions in a domain D⊂C such that each f∈F has only zeros of multiplicity at least k. If, for each pair (f,g) in F, fn(f(k)) and gn(g(k)) share a non-zero complex number a ignoring multiplicity, then F is normal in D.     

Convergence of the wave equation damped on the interior to the one damped on the boundary

In this paper, we study the convergence of the wave equation with variable internal damping term γn(x)ut to the wave equation with boundary damping γ(x)⊗δx∈∂Ωut when (γn(x)) converges to γ(x)⊗δx∈∂Ω in the sense of distributions. When the domain Ω in which these equations are defined is an interval in R, we show that, under natural hypotheses, the compact global attractor of the wave equation damped on the interior converges in X=H¹(Ω)×L²(Ω) to the one of the wave equation damped on the boundary, and that the dynamics on these attractors are equivalent. We also prove, in the higher-dimensional case, that the attractors are lower-semicontinuous in X and upper-semicontinuous in H1−ε(Ω)×H−ε(Ω).     

Graphs with small boundary

For a pair of vertices x and y in a graph G, we denote by d_G(x,y) the distance between x and y in G. We call x a boundary vertex of y if x and y belong to the same component and d_G(y,v)?d_G(y,x) for each neighbor v of x in G. A boundary vertex of some vertex is simply called a boundary vertex, and the set of boundary vertices in G is called the boundary of G, and is denoted by B(G).In this paper, we investigate graphs with a small boundary. Since a pair of farthest vertices are boundary vertices, |B(G)|?2 for every connected graph G of order at least two. We characterize the graphs with boundary of order at most three. We cannot give a characterization of graphs with exactly four boundary vertices, but we prove that such graphs have minimum degree at most six. Finally, we give an upper bound to the minimum degree of a connected graph G in terms of |B(G)|.     

On the existence of an invariant non-degenerate bilinear form under a linear map

Let V be a vector space over a field F. Assume that the characteristic of F is large, i.e. char(F)>dimV. Let T:V→V be an invertible linear map. We answer the following question in this paper. When doesVadmit a T-invariant non-degenerate symmetric (resp. skew-symmetric) bilinear form? We also answer the infinitesimal version of this question.Following Feit and Zuckerman 2, an element g in a group G is called real if it is conjugate in G to its own inverse. So it is important to characterize real elements in GL(V,F). As a consequence of the answers to the above question, we offer a characterization of the real elements in GL(V,F).Suppose V is equipped with a non-degenerate symmetric (resp. skew-symmetric) bilinear form B. Let S be an element in the isometry group I(V,B). A non-degenerate S-invariant subspace W of (V,B) is called orthogonally indecomposable with respect to S if it is not an orthogonal sum of proper S-invariant subspaces. We classify the orthogonally indecomposable subspaces. This problem is non-trivial for the unipotent elements in I(V,B). The level of a unipotent T is the least integer k such that (T-I)^k=0. We also classify the levels of unipotents in I(V,B).     

Functional convergence of stochastic integrals with application to statistical inference

Assuming that {(U_n,V_n)} is a sequence of càdlàg processes converging in distribution to (U,V) in the Skorohod topology, conditions are given under which {?f_n(β,u,v)dU_ndV_n} converges weakly to ?f(β,x,y)dUdV in the space C(R), where f_n(β,u,v) is a sequence of “smooth” functions converging to f(β,u,v). Integrals of this form arise as the objective function for inference about a parameter β in a stochastic model. Convergence of these integrals play a key role in describing the asymptotics of the estimator of β which optimizes the objective function. We illustrate this with a moving average process.     

Multiscale Young measures in homogenization of continuous stationary processes in compact spaces and applications

We introduce a framework for the study of nonlinear homogenization problems in the setting of stationary continuous processes in compact spaces. The latter are functions f○T:Rn×Q→Q with f○T(x,ω)=f(T(x)ω) where Q is a compact (Hausdorff topological) space, f∈C(Q) and T(x):Q→Q, x∈Rn, is an n-dimensional continuous dynamical system endowed with an invariant Radon probability measure μ. It can be easily shown that for almost all ω∈Q the realization f(T(x)ω) belongs to an algebra with mean value, that is, an algebra of functions in BUC(Rn) containing all translates of its elements and such that each of its elements possesses a mean value. This notion was introduced by Zhikov and Krivenko [V.V. Zhikov, E.V. Krivenko, Homogenization of singularly perturbed elliptic operators, Mat. Zametki 33 (1983) 571-582, English transl. in Math. Notes 33 (1983) 294-300]. We then establish the existence of multiscale Young measures in the setting of algebras with mean value, where the compactifications of Rn provided by such algebras plays an important role. These parametrized measures are useful in connection with the existence of correctors in homogenization problems. We apply this framework to the homogenization of a porous medium type equation in Rn with a stationary continuous process as a stiff oscillatory external source. This application seems to be new even in the classical context of periodic homogenization.     

Listing minimal edge-covers of intersecting families with applications to connectivity problems

Let G=(V,E) be a directed/undirected graph, let s,t∈V, and let F be an intersecting family on V (that is, X∩Y,X∪Y∈F for any intersecting X,Y∈F) so that s∈X and t∉X for every X∈F. An edge set I⊆E is an edge-cover of F if for every X∈F there is an edge in I from X to V−X. We show that minimal edge-covers of F can be listed with polynomial delay, provided that, for any I⊆E the minimal member of the residual family F_I of the sets in F not covered by I can be computed in polynomial time. As an application, we show that minimal undirected Steiner networks, and minimal k-connected and k-outconnected spanning subgraphs of a given directed/undirected graph, can be listed in incremental polynomial time.     

Little Grothendieck's theorem for sublinear operators

Let SB(X,Y) be the set of the bounded sublinear operators from a Banach space X into a Banach lattice Y. Consider π₂(X,Y) the set of 2-summing sublinear operators. We study in this paper a variation of Grothendieck's theorem in the sublinear operators case. We prove under some conditions that every operator in SB(C(K),H) is in π₂(C(K),H) for any compact K and any Hilbert H. In the noncommutative case the problem is still open.     

On the continuity of left translations in the LUC-compactification

Consider the continuity of left translations in the LUC-compactification GLUC of a locally compact group G. For every X⊆G, let κ(X) be the minimal cardinality of a compact covering of X in G. Let U(G) be the points in GLUC that are not in the closure of any X⊆G with κ(X)<κ(G). We show that the points at which no left translation in U(G) is continuous are dense in U(G). This result is a generalization of a theorem by van Douwen concerning discrete groups. We obtain a new proof for the fact that the topological center of GLUC?G is empty.     

An improvement of Montel's criterion

Let F be a family of holomorphic functions in a domain D, and let a(z), b(z) be two holomorphic functions in D such that a(z)?b(z), and a(z)?a^′(z) or b(z)?b^′(z). In this paper, we prove that: if, for each f∈F, f(z)−a(z) and f(z)−b(z) have no common zeros, f^′(z)=a(z) whenever f(z)=a(z), and f^′(z)=b(z) whenever f(z)=b(z) in D, then F is normal in D. This result improves and generalizes the classical Montel's normality criterion, and the related results of Pang, Fang and the first author. Some examples are given to show the sharpness of our result.     

On the Hyers-Ulam-Rassias stability of functional equations in n-variables

In this paper we investigate a generalization of the Hyers-Ulam-Rassias stability for a functional equation of the form f(φ(X))=?(X)f(X)+ψ(X) and the stability in the sense of Ger for the functional equation of the form f(φ(X))=?(X)f(X), where X lie in n-variables. As a consequence, we obtain a stability result in the sense of Hyers-Ulam-Rassias, Gǎvruta, and Ger for some well-known equations such as the gamma, beta, and G-function type's equations.     

Finding large cycles in Hamiltonian graphs

We show how to find in Hamiltonian graphs a cycle of length n^{Ω(1/loglogn)}=exp(Ω(logn/loglogn)). This is a consequence of a more general result in which we show that if G has a maximum degree d and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in O(n³) time a cycle in G of length k^Ω(1/logd). From this we infer that if G has a cycle of length k, then one can find in O(n³) time a cycle of length k^{Ω(1/(log(n/k)+loglogn))}, which implies the result for Hamiltonian graphs. Our results improve, for some values of k and d, a recent result of Gabow (2004) [11] showing that if G has a cycle of length k, then one can find in polynomial time a cycle in G of length . We finally show that if G has fixed Euler genus g and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in polynomial time a cycle in G of length f(g)k^Ω(1), running in time O(n²) for planar graphs.     

Frobenius splitting and geometry of G-Schubert varieties

Let X be an equivariant embedding of a connected reductive group G over an algebraically closed field k of positive characteristic. Let B denote a Borel subgroup of G. A G-Schubert variety in X is a subvariety of the form diag(G)⋅V, where V is a B×B-orbit closure in X. In the case where X is the wonderful compactification of a group of adjoint type, the G-Schubert varieties are the closures of Lusztig's G-stable pieces. We prove that X admits a Frobenius splitting which is compatible with all G-Schubert varieties. Moreover, when X is smooth, projective and toroidal, then any G-Schubert variety in X admits a stable Frobenius splitting along an ample divisors. Although this indicates that G-Schubert varieties have nice singularities we present an example of a nonnormal G-Schubert variety in the wonderful compactification of a group of type G₂. Finally we also extend the Frobenius splitting results to the more general class of R-Schubert varieties.     

A general Trotter-Kato formula for a class of evolution operators

In this article we prove new results concerning the existence and various properties of an evolution system UA+B(t,s)_0?s?t?T generated by the sum −(A(t)+B(t)) of two linear, time-dependent and generally unbounded operators defined on time-dependent domains in a complex and separable Banach space B. In particular, writing L(B) for the algebra of all linear bounded operators on B, we can express UA+B(t,s)_0?s?t?T as the strong limit in L(B) of a product of the holomorphic contraction semigroups generated by −A(t) and −B(t), respectively, thereby proving a product formula of the Trotter-Kato type under very general conditions which allow the domain D(A(t)+B(t)) to evolve with time provided there exists a fixed set D⊂_?t∈[0,T]D(A(t)+B(t)) everywhere dense in B. We obtain a special case of our formula when B(t)=0, which, in effect, allows us to reconstruct UA(t,s)_0?s?t?T very simply in terms of the semigroup generated by −A(t). We then illustrate our results by considering various examples of nonautonomous parabolic initial-boundary value problems, including one related to the theory of time-dependent singular perturbations of self-adjoint operators. We finally mention what we think remains an open problem for the corresponding equations of Schrödinger type in quantum mechanics.     

On derivable mappings

A linear mapping δ from an algebra A into an A-bimodule M is called derivable at c∈A if δ(a)b+aδ(b)=δ(c) for all a,b∈A with ab=c. For a norm-closed unital subalgebra A of operators on a Banach space X, we show that if C∈A has a right inverse in B(X) and the linear span of the range of rank-one operators in A is dense in X then the only derivable mappings at C from A into B(X) are derivations; in particular the result holds for all completely distributive subspace lattice algebras, J-subspace lattice algebras, and norm-closed unital standard algebras of B(X). As an application, every Jordan derivation from such an algebra into B(X) is a derivation. For a large class of reflexive algebras A on a Banach space X, we show that inner derivations from A into B(X) can be characterized by boundedness and derivability at any fixed C∈A, provided C has a right inverse in B(X). We also show that if A is a canonical subalgebra of an AF C^∗-algebra B and M is a unital Banach A-bimodule, then every bounded local derivation from A into M is a derivation; moreover, every bounded linear mapping from A into B that is derivable at the unit I is a derivation.     

The Banach-Lie algebra of multiplication operators on a JBW-triple

The Banach-Lie algebra L(A) of multiplication operators on the JB^∗-triple A is introduced and it is shown that the hermitian part Lh(A) of L(A) is a unital GM-space the base of the dual cone in the dual GL-space ^∗(Lh(A)) of which is affine isomorphic and weak^∗-homeomorphic to the state space of L(A). In the case in which A is a JBW^∗-triple, it is shown that tripotents u and v in A are orthogonal if and only if the corresponding multiplication operators in the unital GM-space Lh(A) satisfy

0?D(u,u)+D(v,v)?idA,     

On the global offensive alliance number of a graph

An offensive alliance in a graph Γ=(V,E) is a set of vertices S⊂V where for each vertex v in its boundary the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V?S, that is, S is a dominating set of Γ. The global offensive alliance numberγ_o(Γ) is the minimum cardinality of a global offensive alliance in Γ. An offensive alliance is connected if its induced subgraph is connected. The global-connected offensive alliance number, γ_co(Γ), is the minimum cardinality of a global-connected offensive alliance in Γ.In this paper we obtain several tight bounds on γ_o(Γ) and γ_co(Γ) in terms of several parameters of Γ. The case of strong alliances is studied by analogy.