Sharp estimates for solutions of multi‐bubbles in compact Riemann surfaces

In this paper, we consider a sequence of multibubble solutions u_k of the equation (0.1) where h is a C^2,β positive function in a compact Riemann surface M, and ρ_k is a constant satisfying lim_k→+∞ ρ_k = 8mπ for some positive integer m ≥ 1. We prove among other things that where p_k,j are centers of the bubbles of u_k and λ_k,j are the local maxima of u_k after adding a constant. This yields a uniform bound of solutions as ρ_k converges to 8mπ from below provided that . It generalizes a previous result, due to Ding, Jost, Li, and Wang [18] and Nolasco and Tarantello [31], hich says that any sequence of minimizers u_k is uniformly bounded if ρ_k > 8π and h satisfies for any maximum point p of the sum of 2 log h and the regular part of the Green function, where K is the Gaussian curvature of M. The analytic work of this paper is the first step toward computing the topological degree of ( 0.1 ), which was initiated by Li [24]. © 2002 Wiley Periodicals, Inc.     

Oscillation and Nonoscillation of a Class of Functional Equations

In this paper, we consider the following equation where p, Q_i : I → ℝ⁺ = (0, ∞), i = 1, 2, ..., m, I ⊂ (0, ∞) is an unbounded set, g : I → I, g(t) ≢ t, lim_t→∞ g(t) = ∞, t ∈ I, k ≥ 1 is a positive integer. Some oscillation and nonoscillation criteria are obtained.     

Ore‐type degree conditions for a graph to be H‐linked

Given a fixed multigraph H with V(H) = {h₁,…, h_m}, we say that a graph G is H‐linked if for every choice of m vertices v₁, …, _vm in G, there exists a subdivision of H in G such that for every i, v_i is the branch vertex representing h_i. This generalizes the notion of k‐linked graphs (as well as some other notions). For a family of graphs, a graph G is ‐linked if G is H‐linked for every . In this article, we estimate the minimum integer r = r(n, k, d) such that each n‐vertex graph with is ‐linked, where is the family of simple graphs with k edges and minimum degree at least . © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 14–26, 2008     

Nonlinear equations based on jointly homogeneous mappings

In this paper, we consider a nonlinear equation based on two-variable monotone and jointly homogeneous functions on an open convex normal cone

x=g(h(a,x),k(b,x))     

Improper choosability of graphs and maximum average degree

Improper choosability of planar graphs has been widely studied. In particular, ?krekovski investigated the smallest integer g_k such that every planar graph of girth at least g_k is k‐improper 2‐choosable. He proved [9] that 6 ≤ g₁ ≤ 9; 5 ≤ g₂ ≤ 7; 5 ≤ g₃ ≤ 6; and ? k ≥ 4, g_k = 5. In this article, we study the greatest real M(k, l) such that every graph of maximum average degree less than M(k, l) is k‐improper l‐choosable. We prove that if l ≥ 2 then . As a corollary, we deduce that g₁ ≤ 8 and g₂ ≤ 6, and we obtain new results for graphs of higher genus. We also provide an upper bound for M(k, l). This implies that for any fixed l, . © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 181–199, 2006     

Normal families of meromorphic functions and shared functions

The paper is devoted to the normal families of meromorphic functions and shared functions. Generalizing a result of Chang (2013), we prove the following theorem. Let h (≠≡ 0,∞) be a meromorphic function on a domain D and let k be a positive integer. Let F be a family of meromorphic functions on D, all of whose zeros have multiplicity at least k + 2, such that for each pair of functions f and g from F, f and g share the value 0, and f^(k) and g^(k) share the function h. If for every f ∈ F, at each common zero of f and h the multiplicities m_f for f and m_h for h satisfy m_f ≥ m_h + k + 1 for k > 1 and m_f ≥ 2m_h + 3 for k = 1, and at each common pole of f and h, the multiplicities nf for f and nh for h satisfy n_f ≥ n_h + 1, then the family F is normal on D.     

Some properties of rational approximations of degree (k, 1) in the hardy spaceH 2(D)

We prove that the well-known interpolation conditions for rational approximations with free poles are not sufficient for finding a rational function of the least deviation. For rational approximations of degree (k, 1), we establish that these interpolation conditions are equivalent to the assertion that the interpolation pointc is a stationary point of the functionk(c) defined as the squared deviation off from the subspace of rational functions with numerator of degree k and with a given pole 1/¯c. For any positive integersk ands, we construct a functiong H₂(D) such thatR _k ,1(g)=R _k +s,1(g) > 0. whereR _k ,1(g) is the least deviation ofg from the class of rational function of degree (k, 1).Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 251–259, August, 1998.The author is keenly grateful to N. S. Vyacheslavov, E. P. Dolzhenko, and V. G. Zinov for useful discussions.     

Über ganze Funktionen,die einer linearen Differentialgleichung genügen

Consider the homogeneous linear differential equation where the coefficients a_j(z) are entire functions. Then every solution w(z)0 of this equation (*) is an entire function. In this paper we give the necessary and sufficient conditions that n-1 linearly independent entire functions satisfy a differential equation (*) of order n. Especially we prove the following theorem: Given k linearly independent entire functions g₁(z), g₂(z),..., g_k(z). This functions are solutions of a differential equation (*) if and only if there exists an integer M< such that for any linear combination g(z)=C₁g₁(z)+...+c_kg_k(z)O this number M is an upper bound for the multiplicity of the zeros of g(z). Then holds nk.     

On the stabilization of the Timoshenko system by a weak nonlinear dissipation

In this paper we consider the following Timoshenko‐type system: Without imposing any restrictive growth assumption on g at the origin, we establish a general decay result depending on g and α. Copyright © 2008 John Wiley & Sons, Ltd.     

The k-orbit reconstruction and the orbit algebra

Let (G, W) be a permutation group on a finite set W = {w ₁,..., w _n}. We consider the natural action of G on the set of all subsets of W. Let h ₀, h ₁,..., h _N be the orbits of this action. For each i, 1 i N, there exists k, 1 k n, such that h _i is a set of k-element subsets of W. In this case h _i is called a symmetrized k-orbit of the group (G, W) or simply a k-orbit. With a k-orbit h _i we associate a multiset H(h _i ) = % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyykJeoaaa!3690!\[\langle \]h _i ⁽¹⁾, h _i ⁽²⁾,..., h _i ^(k)% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOkJepaaa!36A1!\[\rangle \] of its (k – 1)-suborbits. Orbits h _i and h _j are called equivalent if H(h _i ) = H(h _j ). An orbit is reconstructible if it is equivalent to itself only. The paper concerns the k-orbit reconstruction problem and its connections with different problems in combinatorics. The technique developed is based on the notion of orbit and co-orbit algebras associated with a given permutation group (G, W).     

A generalized Dantzig—Wolfe decomposition principle for a class of nonconvex programming problems

Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h _j (x)g(x),j=1, ,m, xX}, wheref(·),h _j (·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.     

Asymptotic cone of semisimple orbits for symmetric pairs

Let G be a reductive algebraic group over C and denote its Lie algebra by g. Let Oh be a closed G-orbit through a semisimple element h∈g. By a result of Borho and Kraft (1979) [4], it is known that the asymptotic cone of the orbit Oh is the closure of a Richardson nilpotent orbit corresponding to a parabolic subgroup whose Levi component is the centralizer ZG(h) in G. In this paper, we prove an analogue on a semisimple orbit for a symmetric pair.More precisely, let θ be an involution of G, and K=Gθ a fixed point subgroup of θ. Then we have a Cartan decomposition g=k+s of the Lie algebra g=Lie(G) which is the eigenspace decomposition of θ on g. Let {x,h,y} be a normal sl₂ triple, where x,y∈s are nilpotent, and h∈k semisimple. In addition, we assume , where denotes the complex conjugation which commutes with θ. Then is a semisimple element in s, and we can consider a semisimple orbit Ad(K)a in s, which is closed. Our main result asserts that the asymptotic cone of Ad(K)a in s coincides with , if x is even nilpotent.     

Nonhomogeneous recursions and Generalised Continued Fractions

Consider the (n+1)st order nonhomogeneous recursionX _k+n+1=b _k X _k+n +a _k ⁽ⁿ⁾ X _k+n-1+...+a _k ⁽¹⁾ X _k +X _k .Leth be a particular solution, andf ⁽¹⁾,...,f ⁽ⁿ⁾,g independent solutions of the associated homogeneous equation. It is supposed thatg dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾ andh. If we want to calculate a solutiony which is dominated byg, but dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾, then forward and backward recursion are numerically unstable. A stable algorithm is derived if we use results constituting a link between Generalised Continued Fractions and Recursion Relations.     

Comments on “a numerical approach to the infinite horizon problem of deterministic control theory”

In the paper cited above a proof about an estimate of the rate of convergence for a special discretization scheme for the Hamilton—Jacobi equation is given. The proof is essentially based on the identification between functions andv _h ^k . Here we give a simple example which shows that this identification is incorrect.     

Arithmetical identities of the Brauer-Rademacher type

Summary LetA be a regular arithmetical convolution andk a positive integer. LetA _k (r) = {d: d ^k A(r ^k )}, and letf A _k g denote the convolution of arithmetical functionsf andg with respect toA _k . A pair (f, g) of arithmetical functions is calledadmissible if(f A _k g)(m) 0 for allm and if the functions satisfy an arithmetical functional equation which generalizes the Brauer—Rademacher identity. Necessary and sufficient conditions are found for a pair (f, g) of multiplicative functions to be admissible, and it follows that, if(f A _k g)(m) 0 f(m) for allm, then (f, g) is admissible if and only if itsdual pair (f A _k g, g ^–1 ) is admissible.Iff andg ^–1 areA _k -multiplicative (a condition stronger than being multiplicative), and(f A _k g)(m) 0 for allm, then (f, g) is admissible, calledCohen admissible. Its dual pair is calledSubbarao admissible. If (f A _k g) ^–1 (m) 0 itsinverse pair (g ^–1 , f ^–1 ) is also Cohen admissible.Ifg is a multiplicative function then there exists a multiplicative functionf such that the pair (f, g) is admissible if and only if for everyA _k -primitive prime powerp ⁱ either (i)g(p ⁱ ) 0 or (ii)g(p ) = 0 for allp havingA _k -type equal tot. There is a similar kind of characterization of the multiplicative functions which are first components of admissible pairs of multiplicative functions. IfA _k is not the unitary convolution, then there exist multiplicative functionsg which satisfy (i) and are such that neitherg norg ^–1 isA _k -multiplicative: hence there exist admissible pairs of multiplicative functions which are neither Cohen admissible nor Subbarao admissible.An arithmetical functionf is said to be anA _k -totient if there areA _k -multiplicative functionsf _T andf _V such thatf = f _T A _k f _V ^-1 Iff andg areA _k -totients with(f A _k g)(m) 0 for allm, and iff _V = g _T , then the pair (f, g) is admissible. The class of such admissible pairs includes many pairs which are neither Cohen admissible nor Subbarao admissible. If (f, g) is a pair in this class, and iff(m), (f A _k g) ^–1 (m), g ^–1 (m),f ^–1 (m) andg(m) are all nonzero for allm, then its dual, its inverse, the dual of its inverse, the inverse of its dual and the inverse of the dual of its inverse are also admissible, and in many cases these six pairs are distinct.A number of related results, and many examples, are given.     

Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in

In this paper we consider the problem of determining whether an unknown arithmetic circuit, for which we have oracle access, computes the identically zero polynomial. This problem is known as the black-box polynomial identity testing (PIT) problem. Our focus is on polynomials that can be written in the form f([`(x)]) = ?<sub>i = 1</sub><sup>k</sup> h<sub>i</sub> ([`(x)]) ·g_i ([`(x)])f(\bar x) = \sum\nolimits_{i = 1}^k {h_i (\bar x) \cdot g_i (\bar x)} , where each h _i is a polynomial that depends on only ρ linear functions, and each g _i is a product of linear functions (when h _i = 1, for each i, then we get the class of depth-3 circuits with k multiplication gates, also known as ΣΠΣ(k) circuits, but the general case is much richer). When max _i (deg(h _i · g _i )) = d we say that f is computable by a ΣΠΣ(k; d;ρ) circuit. We obtain the following results.

Digital Expansions with Respect to Different Bases

We consider the g-ary expansion N=∑ _k b _k (N, g)g ^k of non-negative integers N and prove various results on the distribution and the mean value of the k-th digit b _k (N, g) if g varies in an interval of the form 2≤g≤N ^η. As an application we also consider the average value of the sum-of-digits function s(N, g)=∑ _k b _k (N, g). Received 5 November 2001 RID="a" ID="a" Dedicated to Professor Edmund Hlawka on the occasion of his 85th birthday     

The effect of a penalty term involving higher order derivatives on the distribution of phases in an elastic medium with a two‐well elastic potential

We consider the problem of minimizing 0<p<1, h∈?, σ>0, among functions u:?^d?Ω→?^d, u_∣?Ω=0, and measurable characteristic functions χ:Ω→?. Here ?⁺_h, ?^?, denote quadratic potentials defined on the space of all symmetric d×d matrices, h is the minimum energy of ?⁺_h and ε(u) denotes the symmetric gradient of the displacement field. An equilibrium state û, χ?, of I [·,·,h, σ] is termed one‐phase if χ?≡0 or χ?≡1, two‐phase otherwise. We investigate the way in which the distribution of phases is affected by the choice of the parameters h and σ. Copyright 2002 John Wiley & Sons, Ltd.     

Hölder exponents and box dimension for self-affine fractal functions

We consider some self-affine fractal functions previously studied by Barnsleyet al. The graphs of these functions are invariant under certain affine scalings, and we extend their definition to allow the use of nonlinear scalings. The Hölder exponent,h, for these fractal functions is calculated and we show that there is a larger Hölder exponent,h , defined at almost every point (with respect to Lebesgue measure). For a class of such functions defined using linear affinities these exponents are related to the box dimensionD _B of the graph byh2–D _Bh .Communicated by Michael F. Barnsley.