(g, f)-factorizations orthogonal to a subgraph in graphs

LetG be a graph with vertex setV (G) and edge setE (G), and letg andf be two integer-valued functions defined on V(G) such thatg(x)⩽(x) for every vertexx ofV(G). It was conjectured that ifG is an (mg +m - 1,mf -m+1)-graph andH a subgraph ofG withm edges, thenG has a (g,f)-factorization orthogonal toH. This conjecture is proved affirmatively. Project supported by the National Natural Science Foundation of China.     

Gap Property of Bi-Lipschitz Constants of Bi-Lipschitz Automorphisms on Self-similar Sets

For a given self-similar set E ∪→ R^d satisfying the strong separation condition, let Aut（E） be the set of all bi-Lipschitz automorphisms on E. The authors prove that {f ∈ Aut（E） ： blip（f） = 1} is a finite group, and the gap property of bi-Lipschitz constants holds, i.e., inf{blip（f） ≠ 1： f ∈ Aut（E）} 〉 1, where lip（g） =sup x,y∈E x≠y ｜g（x）-g（y）｜/｜x-y｜ and blip（g） =max（lip（g）, liP（g^-1））.     

Invertibility of the Sum of Idempotents

We study necessary and sufficient conditions for the invertibility of the sum f+g when f and g are idempotents in a unital ring or bounded linear operators in Hilbert or Banach spaces. We describe the relation between the invertibility of f+g and f m g.     

Obstruction theory and coincidences of maps between nilmanifolds

Let f, g : M N be two maps between two compact nilmanifolds with dim M dim N = n. In this paper, we show that either the Nielsen coincidence number N(f, g) = 0 or N(f, g) = R(f, g) where R(f, g) denotes the Reidemeister number of f and g. Furthermore, we show that if N(f, g) > 0 then the primary obstruction o_n(f, g) to deforming f and g to be coincidence free on the n-th skeleton of M is non-trivial.Received: 30 April 2004; revised: 20 July 2004     

Irreducibility Results for Compositions of Polynomials with Integer Coefficients

We obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form f ○ g, where f,g are polynomials with integer coefficients, in terms of the prime factorization of the leading coefficients of f and g, the degrees of f and g, and the size of coefficients of f. In particular, some irreducibility results are given for this class of compositions of polynomials.     

Irreducibility Results for Compositions of Polynomials with Integer Coefficients

We obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form f ○ g, where f,g are polynomials with integer coefficients, in terms of the prime factorization of the leading coefficients of f and g, the degrees of f and g, and the size of coefficients of f. In particular, some irreducibility results are given for this class of compositions of polynomials.     

Decomposition of Graphs into (g, f)-Factors

Let G be a multigraph, g and f be integer-valued functions defined on V(G). Then a graph G is called a (g, f)-graph if g(x)≤deg _G(x)≤f(x) for each x∈V(G), and a (g, f)-factor is a spanning (g, f)-subgraph. If the edges of graph G can be decomposed into (g, f)-factors, then we say that G is (g, f)-factorable. In this paper, we obtained some sufficient conditions for a graph to be (g, f)-factorable. One of them is the following: Let m be a positive integer, l be an integer with l=m (mod 4) and 0≤l≤3. If G is an -graph, then G is (g, f)-factorable. Our results imply several previous (g, f)-factorization results. Revised: June 11, 1998     

Dividing Polynomials Using the Resultant Matrix

Let f, g be polynomials over a Noetherian ring A. We use the matrix coming from the resultant of f and g to get a criterion for divisibility of f by g in terms of Fitting invariants as well as a method of dividing polynomials once we know g divides f. Further we show that this is equivalent to that cokernel or the image of the multiplication-by-g map on A[X]/(f) is free. As an application we show one can test irreducibility of an integral polynomial by computing minors of a matrix.     

Estimates for the zeros of differences of meromorphic functions

Let f be a transcendental meromorphic function and g(z)=f(z+c1)+f(z+c2)-2f(z) and g2(z)=f(z+c1)·f(z+c2)-f2(z).The exponents of convergence of zeros of differences g(z),g2(z),g(z)/f(z),and g2(z)/f2(z) are estimated accurately.     

Identity principles for commuting holomorphic self-maps of the unit disc

Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g.     

On the iteration of holomorphic self-maps of ℂ*

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

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.     

Connected Factors and Spanning Trees in Graphs

 Let G be a graph, and g, f, f′ be positive integer-valued functions defined on V(G). If an f′-factor of G is a spanning tree, we say that it is f′-tree. In this paper, it is shown that G contains a connected (g, f+f′−1)-factor if G has a (g, f)-factor and an f′-tree. Received: October 30, 2000 Final version received: August 20, 2002     

On meromorphic solutions of <Emphasis Type="Italic">f</Emphasis><Superscript>2</Superscript> + <Emphasis Type="Italic">g</Emphasis><Superscript>2</Superscript> = 1

We show that meromorphic solutions f, g of f ² + g ² = 1 in C² must be constant, if f _z2 and g _z1 have the same zeros (counting multiplicities). We also apply the result to characterize meromorphic solutions of certain nonlinear partial differential equations.     

Generalized weighted quasi-arithmetic means

Under some natural assumptions on real functions f and g defined on a real interval I, we show that a two variable function M _f,g : I ² → I defined by

Porosity and the L p -conjecture

Recently, Abtahi, Nasr-Isfahani, and Rejali [1] have shown that if G is a locally compact but not compact topological group and p > 2, then there are two functions, f and g, such that the convolution f*g{f\star g} is equal to ∞ on some set of positive measure. In the paper we show the nonexistence of f*g{f\star g} on a set of positive measure for (f, g) from a complement of a σ-porous set.     

Properties of differences of meromorphic functions

Let f be a transcendental meromorphic function. We propose a number of results concerning zeros and fixed points of the difference g(z) = f(z + c) − f(z) and the divided difference g(z)/f(z).     

A characterization of positively decomposable non-linear maps between Banach lattices

A map between Banach lattices E and F is called positively decomposable if Tf = g ₁ + g ₂ for f, g ₁, g ₂ positive and g ₁ and g ₂ disjoint implies there exist disjoint positive elements f ₁ and f ₂ each less than f with the property that Tf ₁ = g ₁ and Tf ₂ = g ₂. Recently, the positive decomposability of linear Carleman operators on Banach lattices were characterized using disjointness condition of images of the approximate atoms. This note provides an extension of the characterization for a class of non-linear maps. Further, disjointness preserving maps are studied.      

The Kramers–;Wannier Symmetry and S-Duality in the Two-Dimensional g03A6;4 Theory

We show that the exact beta function of the two-dimensional g⁴ theory possesses two dual symmetries. These are the Kramers–Wannier symmetry d(g) and the strong–weak-coupling symmetry, or the S-duality f(g), connecting the strong- and weak-coupling domains lying above and below the fixed point g ^*. We obtain explicit representations for the functions d(g) and f(g). The S-duality transformation f(g) allows using the high-temperature expansions to approximate the contributions of the higher-order Feynman diagrams. From the mathematical standpoint, the proposed scheme is highly unstable. Nevertheless, the approximate values of the renormalized coupling constant g ^* obtained from the duality equations agree well with the available numerical results.