Fonctions séparément harmoniques,un théorème de type Terada

Given D a domain in , G an open set in and E a subset of D verifying the harmonic analogue of Local Polynomial Condition of Leja at some point in D. We prove that if f(x, y) is a complex function defined on D × G such that– f(x, ) is harmonic on G for every fixed x E,– f(, y) is harmonic on D for every fixed y G,then f is harmonic in (x, y) on D × G.     

Partial Parity (g,f )-Factors and Subgraphs Covering Given Vertex Subsets

 Let G be a graph and W a subset of V(G). Let g,f:V(G)→Z be two integer-valued functions such that g(x)≤f(x) for all x∈V(G) and g(y)≡f(y) (mod 2) for all y∈W. Then a spanning subgraph F of G is called a partial parity (g,f)-factor with respect to W if g(x)≤deg _F (x)≤f(x) for all x∈V(G) and deg _F (y)≡f(y) (mod 2) for all y∈W. We obtain a criterion for a graph G to have a partial parity (g,f)-factor with respect to W. Furthermore, by making use of this criterion, we give some necessary and sufficient conditions for a graph G to have a subgraph which covers W and has a certain given property. Received: June 14, 1999?Final version received: August 21, 2000     

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph

Let G be a graph and S ⊂ V(G). We denote by α(S) the maximum number of pairwise nonadjacent vertices in S. For x, y ∈ V(G), the local connectivity κ(x, y) is defined to be the maximum number of internally-disjoint paths connecting x and y in G. We define . In this paper, we show that if κ(S) ≥ 3 and for every independent set {x ₁, x ₂, x ₃, x ₄} ⊂ S, then G contains a cycle passing through S. This degree condition is sharp and this gives a new degree sum condition for a 3-connected graph to be hamiltonian.     

Biconvex sets and optimization with biconvex functions: a survey and extensions

The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function is called biconvex, if f(x,y) is convex in y for fixed x∈X, and f(x,y) is convex in x for fixed y∈Y. This paper presents a survey of existing results concerning the theory of biconvex sets and biconvex functions and gives some extensions. In particular, we focus on biconvex minimization problems and survey methods and algorithms for the constrained as well as for the unconstrained case. Furthermore, we state new theoretical results for the maximum of a biconvex function over biconvex sets. J. Gorski and K. Klamroth were partially supported by a grant of the German Research Foundation (DFG).     

Homomorphisms between JC＊-algebras and Lie C＊-algebras

It is shown that every almost ＊-homomorphism h ： A→B of a unital JC＊-algebra A to a unital JC＊-algebra B is a ＊-homomorphism when h（rx） = rh（x） （r 〉 1） for all x∈A, and that every almost linear mapping h ： A→B is a ＊-homomorphism when h（2^nu o y） - h（2^nu） o h（y）, h（3^nu o y） - h（3^nu） o h（y） or h（q^nu o y） = h（q^nu） o h（y） for all unitaries u ∈A, all y ∈A, and n = 0, 1,.... Here the numbers 2, 3, q depend on the functional equations given in the almost linear mappings. We prove that every almost ＊-homomorphism h ： A→B of a unital Lie C＊-algebra A to a unital Lie C＊-algebra B is a ＊-homomorphism when h（rx） = rh（x） （r 〉 1） for all x ∈A.     

On the Cauchy difference on normed spaces

LetX be a real linear normed space, (G, +) be a topological group, andK be a discrete normal subgroup ofG. We prove that if a continuous at a point or measurable (in the sense specified later) functionf:X →G fulfils the condition:f(x +y) -f(x) -f(y) ∈K whenever ‖x‖ = ‖y‖, then, under some additional assumptions onG,K, andX, there esists a continuous additive functionA :X →G such thatf(x) -A(x) ∈K.     

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

Non-wandering points and the depth for graph maps

Let G be a graph and f:G→G be continuous.Denote by R(f) andΩ(f) the set of recurrent points and the set of non-wandering points of f respectively.LetΩ_0(f) = G andΩ_n(f)=Ω(f|_(Ω_(n-1)(f))) for all n∈N.The minimal m∈NU {∞} such thatΩ_m(f)=Ω_(m 1)(f) is called the depth of f.In this paper,we show thatΩ_2 (f)=(?) and the depth of f is at most 2.Furthermore,we obtain some properties of non-wandering points of f.     

Generalized bisymmetry on a restricted domain

Let X ⊂ ℝ be an interval of positive length and define the set Δ = {(x, y) ∈ X × X | x ≧ y}. We give the solution of the equation

On quadratic differences that depend on the product of arguments - revisited

Summary. Let be a field of real or complex numbers and denote the set of nonzero elements of . Let be an abelian group. In this paper, we solve the functional equation f ₁ (x + y) + f ₂ (x - y) = f ₃ (x) + f ₄ (y) + g(xy) by modifying the domain of the unknown functions f ₃, f ₄, and g from to and using a method different from [3]. Using this result, we determine all functions f defined on and taking values on such that the difference f(x + y) + f (x - y) - 2 f(x) - 2 f(y) depends only on the product xy for all x and y in      

One sufficient condition for Hamiltonian graphs involving distances

In 1990 G. T. Chen proved that if G is a 2-connected graph of order n and 2|N(x) ∪ N(y)| + d(x) + d(y) ≥ 2n − 1 for each pair of nonadjacent vertices x, y ∈ V (G), then G is Hamiltonian. In this paper we prove that if G is a 2-connected graph of order n and 2|N(x) ∪ N(y)| + d(x)+d(y) ≥ 2n−1 for each pair of nonadjacent vertices x, y ∈ V (G) such that d(x, y) = 2, then G is Hamiltonian.     

Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

Let G = (V, E) be a connected graph. For a vertex subset , G[S] is the subgraph of G induced by S. A cycle C (a path, respectively) is said to be an induced cycle (path, respectively) if G[V(C)] = C (G[V(P)] = P, respectively). The distance between a vertex x and a subgraph H of G is denoted by , where d(x, y) is the distance between x and y. A subgraph H of G is called 2-dominating if d(x, H) ≤ 2 for all . An induced path P of G is said to be maximal if there is no induced path P′ satisfying and . In this paper, we assume that G is a connected claw-free graph satisfying the following condition: for every maximal induced path P of length p ≥ 2 with end vertices u, v it holds:

Very weak solutions to elliptic equations with nonlinear Neumann boundary conditions

Consider the equation −Δu = 0 in a bounded smooth domain , complemented by the nonlinear Neumann boundary condition ∂_ν u = f(x, u) − u on ∂Ω. We show that any very weak solution of this problem belongs to L ^∞(Ω) provided f satisfies the growth condition |f(x, s)| ≤ C(1 + |s| ^p ) for some p ∈ (1, p*), where . If, in addition, f(x, s) ≥ −C + λs for some λ > 1, then all positive very weak solutions are uniformly a priori bounded. We also show by means of examples that p* is a sharp critical exponent. In particular, using variational methods we prove the following multiplicity result: if N ∈ {3, 4} and f(x, s) =  s ^p then there exists a domain Ω and such that our problem possesses at least two positive, unbounded, very weak solutions blowing up at a prescribed point of ∂Ω provided . Our regularity results and a priori bounds for positive very weak solutions remain true if the right-hand side in the differential equation is of the form h(x, u) with h satisfying suitable growth conditions.     

On coefficient estimates for a class of holomorphic mappings

Let X be a complex Banach space with norm ‖ · ‖, B be the unit ball in X, D ⁿ be the unit polydisc in ℂ ⁿ . In this paper, we introduce a class of holomorphic mappings on B or D ⁿ . Let f(x) be a normalized locally biholomorphic mapping on B such that (Df(x))⁻¹ f(x) ∈ and f(x) − x has a zero of order k + 1 at x = 0. We obtain coefficient estimates for f(x). These results unify and generalize many known results. This work was supported by National Natural Science Foundation of China (Grant No. 10571164), Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20050358052), the Jiangxi Provincial Natural Science Foundation of China (Grant No. 2007GZS0177) and Specialized Research Fund for the Doctoral Program of Jiangxi Normal University.     

Rectifiable oscillations in second-order half-linear differential equations

Second-order half-linear differential equation (H): on the finite interval I = (0,1] will be studied, where , p > 1 and the coefficient f(x) > 0 on I, , and . In case when p = 2, the equation (H) reduces to the harmonic oscillator equation (P): y′′ + f(x)y = 0. In this paper, we study the oscillations of solutions of (H) with special attention to some geometric and fractal properties of the graph . We establish integral criteria necessary and sufficient for oscillatory solutions with graphs having finite and infinite arclength. In case when , λ > 0, α > p, we also determine the fractal dimension of the graph G(y) of the solution y(x). Finally, we study the L ^p nonintegrability of the derivative of all solutions of the equation (H).      

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

Multilinear polynomials and cocentralizing conditions in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, let Z(R) be its center, let U be the Utumi quotient ring of R, let C be the extended centroid of R, and let f(x ₁,..., x _n ) be a noncentral multilinear polynomial over C in n noncommuting variables. Denote by f(R) the set of all evaluations of f(x ₁, …, xn) on R. If F and G are generalized derivations of R such that [[F(x), x], [G(y), y]] ∈ Z(R) for any x, y ∈ f(R), then one of the following holds:

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     

Singular Integrals and Potential Theory

In this paper I consider a class of non-standard singular integrals motivated by potential theoretic and probabilistic considerations. The probabilistic applications, which are by far the most interesting part of this circle of ideas, are only outlined in Section 1.5: They give the best approximation of the solution of the classical Dirichlet problem in a Lipschitz domain by the corresponding solution by finite differences. The potential theoretic estimate needed for this gives rise to a natural duality between the L _p functions on the boundary ∂Ω and a class of functions A on Ω that was first considered by Dahlberg. The actual duality is given by ∫_Ω S f(x)A(x)dx = (f, A) where S f(x) = ∫_∂Ω |x − y|¹⁻ⁿ f(y)dy is the Newtonian potential. We can identify the upper half Lipschitz space with in the obvious way and express for an appropriate kernel K. It is the boundedness properties of the above (for , ) that is the essential part of this work. This relates with more classical (but still “rough”) singular integrals that have been considered by Christ and Journé. Lecture held in the Seminario Matematico e Fisico on March 14, 2005 Received: April 2007     

An Inertial Proximal Algorithm with Dry Friction: Finite Convergence Results

Let H be a Hilbert space and A, B: H ⇉ H two maximal monotone operators. In this paper, we investigate the properties of the following proximal type algorithm: