Pseudo-Anosov extensions and degree one maps between hyperbolic surface bundles

Let F′,F be any two closed orientable surfaces of genus g′ > g≥ 1, and f:F→ F be any pseudo-Anosov map. Then we can “extend” f to be a pseudo- Anosov map f′:F′→ F′ so that there is a fiber preserving degree one map M(F′,f′)→ M(F,f) between the hyperbolic surface bundles. Moreover the extension f′ can be chosen so that the surface bundles M(F′,f′) and M(F,f) have the same first Betti numbers. Y. Ni is partially supported by a Centennial fellowship of the Graduate School at Princeton University. S.C. Wang is partially supported by MSTC     

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

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     

Nonsmooth generalized guiding functions for periodic differential inclusions

We consider the periodic problem for differential inclusions in $$ \user2{\mathbb{R}}^{\rm N} $$ with a nonconvex-valued orientor field F(t, ζ), which is lower semicontinuous in $$ \zeta \in \user2{\mathbb{R}}^{\rm N} $$ Using the notion of a nonsmooth, locally Lipschitz generalized guiding function, we prove that the inclusion has periodic solutions. We have two such existence theorems. We also study the “convex” periodic problem and prove an existence result under upper semicontinuity hypothesis on F(t, ·) and using a nonsmooth guiding function. Our work was motivated by the recent paper of Mawhin-Ward [23] and extends the single-valued results of Mawhin [19] and the multivalued results of De Blasi-Górniewicz-Pianigiani [4], where either the guiding function is C¹ or the conditions on F are more restrictive and more difficult to verify.     

Smooth Transformation of the Generalized Minimax Problem

We consider the generalized minimax problem, that is, the problem of minimizing a function (x)=F(g ₁(x),...,g _m(x)), where F is a smooth function and each g _i is the maximum of a finite number of smooth functions. We prove that, under suitable assumptions, it is possible to construct a continuously differentiable exact barrier function, whose minimizers yield the minimizers of the function . In this way, the nonsmooth original problem can be solved by usual minimization techniques for unconstrained differentiable functions.     

Connected and Disconnected Maps

A new relation between morphisms in a category is introduced—roughly speaking (accurately in the categories Set and Top), f ∥ g iff morphisms w:dom(f)→dom(g) never map subobjects of fibres of f non-constantly to fibres of g. (In the algebraic setting replace fibre with kernel.) This relation and a slight weakening of it are used to define “connectedness” versus “disconnectedness” for morphisms. This parallels and generalises the classical treatment of connectedness versus disconnectedness for objects in a category (in terms of constant morphisms). The central items of study are pairs (F,G)({\mathcal F},{\mathcal G}) of classes of morphisms which are corresponding fixed points of the polarity induced by the ∥-relation. Properties of such pairs are examined and in particular their relation to (pre)factorisation systems is analysed. The main theorems characterise:

Bernstein�CWalsh Type Theorems for Real Analytic Functions in Several Variables

The aim of this paper is to extend the classical maximal convergence theory of Bernstein and Walsh for holomorphic functions in the complex plane to real analytic functions in ℝ ^N . In particular, we investigate the polynomial approximation behavior for functions F:L→ℂ, L={(Re z,Im z):z∈K}, of the structure F=g[`(h)]F=g\overline{h}, where g and h are holomorphic in a neighborhood of a compact set K⊂ℂ <sup>N</sup> . To this end the maximal convergence number ρ(S <sub>c</sub> ,f) for continuous functions f defined on a compact set S <sub>c</sub> ⊂ℂ <sup>N</sup> is connected to a maximal convergence number ρ(S <sub>r</sub> ,F) for continuous functions F defined on a compact set S <sub>r</sub> ⊂ℝ <sup>N</sup> . We prove that ρ(L,F)=min {ρ(K,h)),ρ(K,g)} for functions F=g[`(h)]F=g\overline{h} if K is either a closed Euclidean ball or a closed polydisc. Furthermore, we show that min {ρ(K,h)),ρ(K,g)}≤ρ(L,F) if K is regular in the sense of pluripotential theory and equality does not hold in general. Our results are based on the theory of the pluricomplex Green’s function with pole at infinity and Lundin’s formula for Siciak’s extremal function Φ. A properly chosen transformation of Joukowski type plays an important role.     

A method constructing density functions: The case of a generalized Rayleigh variable

In this paper we propose a new generalized Rayleigh distribution different from that introduced in Apl. Mat. 47 (1976), pp. 395–412. The construction makes use of the so-called “conservability approach” (see Kybernetika 25 (1989), pp. 209–215) namely, if X is a positive continuous random variable with a finite mean-value E(X), then a new density is set to be f ₁(x) = xf(x)/E(X), where f(x) is the probability density function of X. The new generalized Rayleigh variable is obtained using a generalized form of the exponential distribution introduced by Isaic-Maniu and the present author as f(x).     

A result of Ambrosetti–Prodi type for first-order ODEs with cubic non-linearities. Part I

In this paper, we prove a result of Ambrosetti–Prodi type for the problem x′=f(t,x)+λx, where f(t,x) is T-periodic in t, f(t,0)≡0 and f(t,x) has “cubic nonlinearities”. Received: February 4, 2000?Published online: April 14, 2003 RID="*" ID="*"This paper was partially supported by CDCHT, Universidad de los Andes.     

Extraction of smooth solutions of a class of regular equations in a rectangle

This work is devoted to the study of two-dimensional, regular, almost hypoelliptic operators P(D) = P(D ₂, D ₂) with regular Newton polyhedrons. It is proved that all generalized (weak) solutions of the equation P(D)u = f from a several weighted Sobolev space are infinitely differentiable functions in the rectangle {x ∈ E ²: −a < x ₁ < a, −b < x ₂ < b} in the variable x ₂, in which the function f is infinitely differentiable.     

Orthogonal factorizations of digraphs

Let G be a digraph with vertex set V(G) and arc set E(G) and let g = (g ⁻, g ⁺) and ƒ = (ƒ ⁻, ƒ ⁺) be pairs of positive integer-valued functions defined on V(G) such that g ⁻(x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ ƒ ⁺(x) for each x ∈ V(G). A (g, ƒ)-factor of G is a spanning subdigraph H of G such that g ⁻(x) ⩽ id _H (x) ⩽ ƒ ⁻(x) and g ⁺(x) ⩽ od _H (x) ⩽ ƒ ⁺(x) for each x ∈ V(H); a (g, ƒ)-factorization of G is a partition of E(G) into arc-disjoint (g, ƒ)-factors. Let = {F ₁, F ₂,…, F _m} and H be a factorization and a subdigraph of G, respectively. is called k-orthogonal to H if each F _i , 1 ⩽ i ⩽ m, has exactly k arcs in common with H. In this paper it is proved that every (mg+m−1,mƒ−m+1)-digraph has a (g, f)-factorization k-orthogonal to any given subdigraph with km arcs if k ⩽ min{g ⁻(x), g ⁺(x)} for any x ∈ V(G) and that every (mg, mf)-digraph has a (g, f)-factorization orthogonal to any given directed m-star if 0 ⩽ g(x) ⩽ f(x) for any x ∈ V(G). The results in this paper are in some sense best possible.      

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     

On trigonometric series and primitive functions

It is proved that any measurable, finite function f(x) has a smooth primitive F(x), i.e. there is a function F(x) such that F′(x) = f(x) almost everywhere, and particularly ω(δ; F) = o(δ ln δ). This is an improvement of N. N. Luzin’s theorem which states just the continuity of the primitive F(x).     

Solutions and Multiple Solutions for p（x）-Laplacian Equations with Nonlinear Boundary Condition

The authors study the p（x）-Laplacian equations with nonlinear boundary condition. By using the variational method, under appropriate assumptions on the perturbation terms f1 （x, u）, f2（x, u） and h1（x）, h2（x）, such that the associated functional satisfies the ＂mountain pass lemma＂ and ＂fountain theorem＂ respectively, the existence and multiplicity of solutions are obtained. The discussion is based on the theory of variable exponent Lebesgue and Sobolev spaces.     

A result on the composition of distributions

LetF be a distribution and letf be a locally summable function. The distributionF(f) is defined as the neutrix limit of the sequenceF _n (f), whereF _n (x) = F(x) * δ _n (x) andδ _n (x) is a certain sequence of infinitely differentiable functions converging to the Dirac delta-functionδ(x). The distribution (x^r)^−s is valuated forr, s = 1,2, ….     

Bergman kernel and complex singularity exponent

We give a precise estimate of the Bergman kernel for the model domain defined by Ω _F = “(z,w) ∈ ℂ ⁿ⁺¹: Im w − |F(z)|² > 0”, where F = (f ₁, ..., f _m ) is a holomorphic map from ℂ ⁿ to ℂ ^m , in terms of the complex singularity exponent of F.     

A New Result on Alspach's Problem

Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x)≥2 and f(x)≥5 for all x∈V(G). It is proved that if G is an (mg+m−1, mf−m+1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H. Received: January 19, 1996 Revised: November 11, 1996     

A Generalized Cubic Functional Equation

In this paper, we determine the general solution of the functional equation f1 （2x ＋ y） ＋ f2（2x - y） = f3（x ＋ y） ＋ f4（x - y） ＋ f5（x） without assuming any regularity condition on the unknown functions f1,f2,f3, f4, f5 ： R→R. The general solution of this equation is obtained by finding the general solution of the functional equations f（2x ＋ y） ＋ f（2x - y） = g（x ＋ y） ＋ g（x - y） ＋ h（x） and f（2x ＋ y） - f（2x - y） = g（x ＋ y） - g（x - y）. The method used for solving these functional equations is elementary but exploits an important result due to Hosszfi. The solution of this functional equation can also be determined in certain type of groups using two important results due to Szekelyhidi.     

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     

Hypergraph families with bounded edge cover or transversal number

The transversal number, packing number, covering number and strong stability number of hypergraphs are denoted by τ, ν, ϱ and α, respectively. A hypergraph family t is called τ-bound (ϱ-bound) if there exists a “binding function”f(x) such that τ(H)≦f(v(H)) (ϱ(H)≦f(α(H))) for allH ∈ t. Methods are presented to show that various hypergraph families are τ-bound and/or ϱ-bound. The results can be applied to families of geometrical nature like subforests of trees, boxes, boxes of polyominoes or to families defined by hypergraph theoretic terms like the family where every subhypergraph has the Helly-property.