On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels

A vertex labeling f : V → Z2 of a simple graph G = (V, E) induces two edge labelings f+ , f*: E → Z2 defined by f+ (uv) = f(u)+f(v) and f*(uv) = f(u)f(v). For each i∈Z2 , let vf(i) = |{v ∈ V : f(v) = i}|, e+f(i) = |{e ∈ E : f+(e) = i}| and e*f(i)=|{e∈E:f*(e)=i}|. We call f friendly if |vf(0)-vf(1)|≤ 1. The friendly index set and the product-cordial index set of G are defined as the sets{|e+f(0)-e+f(1)|:f is friendly} and {|e*f(0)-e*f(1)| : f is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel graphs.     

Full friendly index sets of Cartesian products of two cycles

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.     

Maxwell equations and the direction of the electromagnetic field

Let M₀ be the Minkowski space, let Λ₂(M₀) be the space of bivectors in M₀, and let G¹ ⊂ Λ₂(M₀) be the manifold of directions of the physical space, consisting of simple bivectors with square −1. A mapping F: U → Λ₂(M₀), U ⊂ ℝ⁴, satisfying the Maxwell equations is regarded as the tensor of an electromagnetic field in vacuum. The field is described on the basis of a special decomposition F = eω + h(*ω), where the mapping ω: U → G¹ is called the direction of the field, and e: U → (0, +∞) and h: U → ℝ are the electric and magnetic coefficients of the field. The Maxwell equations are reformulated in terms of ω, e, and h. Electromagnetic fields whose set of directions is a point or a one-dimensional subset of G¹ are considered. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 329, 2005, pp. 118–146.     

Lipschitz algebras and peripherally-multiplicative maps

Let X be a compact metric space and let Lip（X） be the Banach algebra of all scalar- valued Lipschitz functions on X, endowed with a natural norm. For each f ∈ Lip（X）, σπ（f） denotes the peripheral spectrum of f. We state that any map Φ from Lip（X） onto Lip（Y） which preserves multiplicatively the peripheral spectrum：
σπ（Φ（f）Φ（g）） = σπ（fg）, A↓f, g ∈ Lip（X）
is a weighted composition operator of the form Φ（f） = τ· （f °φ） for all f ∈ Lip（X）, where τ ： Y → {-1, 1} is a Lipschitz function and φ ： Y→ X is a Lipschitz homeomorphism. As a consequence of this result, any multiplicatively spectrum-preserving surjective map between Lip（X）-algebras is of the form above.     

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

For digraphs D and H, a mapping f : V(D) → V(H) is a homomorphism of D to H if uv ∈ A(D) implies f(u) f(v) ∈ A(H). If, moreover, each vertex u ∈ V(D) is associated with costs c _i (u), i ∈ V(H), then the cost of the homomorphism f is ∑ _{u ∈V(D)} c _f(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H (abbreviated MinHOM(H)). The problem is to decide, for an input graph D with costs c _i (u), u ∈ V(D), i ∈ V(H), whether there exists a homomorphism of D to H and, if one exists, to find one of minimum cost. We obtain a dichotomy classification for the time complexity of MinHOM(H) when H is an oriented cycle. We conjecture a dichotomy classification for all digraphs with possible loops.     

Propriétés Régularisantes de Certains Semi-Groupes Non Linéaires

Let φ be a convex l.s.c. function fromH (Hilbert) into ] - ∞, ∞ ] andD(φ)={u ∈H; φ(u)<+∞}. It is proved that for everyu ₀ ∈D(φ) the equation − (du/dt)(t ∈ ∂φ(u(t)),u(0)=u ₀ has a solution satisfying ÷(du(t)/dt)÷ ≦(c ₁/t)+c ₂. The behavior ofu(t) in the neighborhood oft=0 andt=+∞ as well as the inhomogeneous equation (du(t)/dt)+∂φ(u(t)) ∈f(t) are then studied. Solutions of some nonlinear boundary value problems are given as applications.      

Functional equations on abelian groups with involution

Summary We produce complete solution formulas of selected functional equations of the formf(x +y) ±f(x + σ (ν)) = Σ _I ² =₁ g _l (x)h _l (y),x, y∈G, where the functionsf,g ₁,h ₁ to be determined are complex valued functions on an abelian groupG and where σ:G→G is an involution ofG. The special case of σ=−I encompasses classical functional equations like d’Alembert’s, Wilson’s first generalization of it, Jensen’s equation and the quadratic equation. We solve these equations, the equation for symmetric second differences in product form and similar functional equations for a general involution σ.     

Lefschetz fixed point theory on fibrations

For a fibre preserving map ϕ: E → E on a fibration (E, π, B), we construct a grading preserving map T(ϕ, π) between H*(E) and H*(B) that generalizes the Lefschetz number. If T(ϕ, π) is an isomorphism between H ⁰(E) and H ⁰(B), then π restricts to a surjective local diffeomorphism on each connected component of the fixed point set of ϕ under a transversality condition. This yields a characterization for the bundle H → G → G/H to be trivial when π ₁ (G/H) = 0.     

A Generalization of Orthogonal Factorizations in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valuated functions defined on V(G) such that g(x) ≤f(x) for all x∈V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤d _H (x) ≤f(x) for all x∈V(G). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let = {F ₁, F ₂, ..., F _m } be a factorization of G and H be a subgraph of G with mr edges. If F _i , 1 ≤i≤m, has exactly r edges in common with H, then is said to be r-orthogonal to H. In this paper it is proved that every (mg + kr, mf−kr)-graph, where m, k and r are positive integers with k < m and g≥r, contains a subgraph R such that R has a (g, f)-factorization which is r-orthogonal to a given subgraph H with kr edges. This research is supported by the National Natural Science Foundation of China (19831080) and RSDP of China     

On some special measures on βG

LetG be a discrete abelian group,Ĝ the character group ofG, andl ^∞(G)^* the conjugate ofl ^∞(G) equipped with an Arens product. In many cases, we can find unitary functionsf such that χf is almost convergent to zero for all χ∈Ĝ. Some of these functions are then used to produce elements μ∈l ^∞(G)^* such that γμ=0 whenever γ is an annihilator ofC ₀(G). Regarded as Borel measures on βG, these elements satisfyxμ=0 for allx∈βG/G. They belong to the radical ofl ^∞(G)^*, and each of them generates a left ideal ofl ^∞(G)^* that contains no minimal left ideal.     

Geometric realization of Adams maps

Let G/P be a homogenous space with G a compact connected Lie group and P a connected subgroup of G of equal rank. As the rational cohomology ring of G/P is concentrated in even dimensions, for an integer k we can define the Adams map of type k to be l _k : H*(G/P, ℚ) → H*(G/P, ℚ), l _k (u) = k ⁱ u, u ∈ H ²ⁱ (G/P, ℚ). We show that if k is prime to the order of the Weyl group of G, then l _k can be induced by a self map of G/P. We also obtain results which imply the condition that k is prime to the order of the Weyl group of G is necessary.     

Minus total domination in graphs

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).     

Copositive approximation of periodic functions

Let f be a real continuous 2π-periodic function changing its sign in the fixed distinct points y _i ∈ Y:= {y _i } _i∈ℤ such that for x ∈ [y _i , y _i−1], f(x) ≧ 0 if i is odd and f(x) ≦ 0 if i is even. Then for each n ≧ N(Y) we construct a trigonometric polynomial P _n of order ≦ n, changing its sign at the same points y _i ∈ Y as f, and

Teichmüller sequences on trajectories invariant under a Kleinian group

We extend the results of [T2] to the situation where there is a compatibility with the action of a Kleinian group. A classical Techmüller sequence is a sequence of quasiconformal mapsf _i with complex dilatations of the form , where ϕ is a quadratic differential and 0<-k _i<1 are numbers such thatk _i→1 asi→∞. We proved in [T2] that if τ is a vertical trajectory associated to ϕ, then there is often, for instance if the sequence is normalized so thatf _i fix 3 points, a subsequence such thatf _i tend either toward a constant or an injective map of τ. If there is compatibility with the action of a non-elementary finitely generated Kleinian groupG, we can given a precise characterization which of these cases occurs. Suppose thatf _i induce isomorphisms ϕ_i ofG onto another Kleinian group and that ϕ_i have algebraic limit ϕ. If the quadratic differential is defined on a component of the ordinary set ofG, if there are no parabolic elements, and if τ is extended maximally so that all branches coming together at a singular point are included, then we can state the main result as follows. The limit is a constantc if the stabilizerG _τ of τ is elementary; and, if it is non-elementary, then the limit is injective. In the first case, ϕ(g) is parabolic with fixpointc wheneverg∈G _τ is of infinite order; and in the latter case, the limitf is an embedding of τ in a natural topology of τ, andf embeds τ into a component of the limit set of ϕG whose stabilizer is ϕG _τ. Various extensions and generalizations are presented. The research for this paper has been supported by the project 51749 of the Academy of Finland.     

Roots of C*-algebra elements under numerical range condition

Let be a C*-algebra with unit 1. For each a ∈ , the C*-algebra numerical range is defined by V(a) = {φ(a): φ ∈ , φ ≥ 0,φ(1) = 1}. In a 2003 paper Li, Rodman and Spitkovsky have found the ω-th roots of elements in C*-algebra under a numerical range condition, when ω ∈ [1,∞). In this paper, we will give a short proof of the above result in the case of ω is a positive integer number. We also give a simple proof for ω-th root of an element a ∈ , when ω ∈ [1,∞) and V(a)∩ {z ∈ ℂ: z ≤ 0} = . The first author was supported by the Shiraz university Research Council Grant No. 86-GRSC-32.     

Set vertex colorings and joins of graphs

For a nontrivial connected graph G, let c: V (G) → ℕ be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number x _s (G). A study is made of the set chromatic number of the join G+H of two graphs G and H. Sharp lower and upper bounds are established for x _s (G + H) in terms of x _s (G), x _s (H), and the clique numbers ω(G) and ω(H).     

Potential space estimates in local Hardy spaces for Green potentials in convex domains

Let Ω be a bounded co.nvex domain in Rn(n≥3) and G(x,y) be the Green function of the Laplace operator -△ on Ω. Let hrp(Ω) = {f ∈ D'(Ω) :(E)F∈hp(Rn), s.t. F|Ω = f}, by the atom characterization of Local Hardy spaces in a bounded Lipschitz domain, the bound of f→(△)2(Gf) for every f ∈ hrp(Ω) is obtained, where n/(n 1)＜p≤1.     

Non-oscillatory criteria for a class of second order non-linear forced neutral-delay differential equations

In this paper, sufficient conditions are obtained, so that the second order neutral delay differential equation

Uniform Morse lemma and isotopy criterion for Morse functions on surfaces

Let M be a smooth compact (orientable or not) surface with or without a boundary. Let $ \mathcal{D}_0 $ \mathcal{D}_0 ⊂ Diff(M) be the group of diffeomorphisms homotopic to id _M . Two smooth functions f, g: M → ℝ are called isotopic if f = h ₂ ℴ g ℴ h ₁ for some diffeomorphisms h ₁ ∈ $ \mathcal{D}_0 $ \mathcal{D}_0 and h ₂ ∈ Diff⁺(ℝ). Let F be the space of Morse functions on M which are constant on each boundary component and have no critical points on the boundary. A criterion for two Morse functions from F to be isotopic is proved. For each Morse function f ∈ F, a collection of Morse local coordinates in disjoint circular neighborhoods of its critical points is constructed, which continuously and Diff(M)-equivariantly depends on f in C ^∞-topology on F (“uniform Morse lemma”). Applications of these results to the problem of describing the homotopy type of the space F are formulated.