Uniform and tangential approximation in a stripe by meromorphic functions of optimal growth

The paper discusses the problem of approximation of functions continuous on a closed stripe S _h = {z: |Imz| ≤h} and holomorphic in its interior. The results relate to the uniform and tangential approximation of such functions f by meromorphic functions g with minimal growth in terms of Nevanlinna characteristic T (r, g). The growth depends on the growth of f in S _h and certain differential properties of f on ?S _h . It is assumed that the possible poles of g are restricted to the imaginary axis.     

Solving polynomial optimization problems via the truncated tangency variety and sums of squares

Let f,g_i,i=1,…,l,h_j,j=1,…,m, be polynomials on Rⁿ and S?{x∈Rⁿ∣g_i(x)=0,i=1,…,l,h_j(x)≥0,j=1,…,m}. This paper proposes a method for finding the global infimum of the polynomial f on the semialgebraic set S via sum of squares relaxation over its truncated tangency variety, even in the case where the polynomial f does not attain its infimum on S. Under a constraint qualification condition, it is demonstrated that: (i) The infimum of f on S and on its truncated tangency variety coincide; and (ii) A sums of squares certificate for nonnegativity of f on its truncated tangency variety. These facts imply that we can find a natural sequence of semidefinite programs whose optimal values converge, monotonically increasing to the infimum of f on S.     

A generalization of the cosine-sine functional equation on groups

The functional equation f(xy)=f(x)g(y)+g(x)f(y)+h(x)h(y) is solved where f, g, h are complex functions defined on a group.     

Jackson-Stechkin type inequalities for special moduli of continuity and widths of function classes in the space L 2

We obtain sharp Jackson-Stechkin type inequalities for moduli of continuity of kth order Ω _k in which, instead of the shift operator T _h f, the Steklov operator S _h (f) is used. Similar smoothness characteristic of functions were studied earlier in papers of Abilov, Abilova, Kokilashvili, and others. For classes of functions defined by these characteristics, we calculate the exact values of certain n-widths.     

The extended gamma class and applications

The gamma class Γ _α (g) consists of positive and measurable functions that satisfy f(x+yg(x))/f(x)→exp(αy). In most cases, the auxiliary function g is Beurling varying, i.e. g(x)/x→0 and g∈Γ₀(g). Taking h=logf, we find that h∈EΓ _α (g,1), where EΓ _α (g,a) is the class of ultimately positive and measurable functions that satisfy (f(x+yg(x))?f(x))/a(x)→αy. In this paper, we discuss local uniform convergence for functions in the classes Γ _α (g) and EΓ _α (g,a). From this we obtain several representation theorems. We also prove some higher order relations for functions in the classes Γ _α (g) and EΓ _α (g,a). Some applications conclude the paper.     

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.     

Normal family and the sequence of omitted functions

Let {fn} be a sequence of meromorphic functions on a plane domain D, whose zeros and poles have multiplicity at least 3. Let {hn} be a sequence of meromorphic functions on D, whose poles are multiple, such that {hn} converges locally uniformly in the spherical metric to a function h which is meromorphic and zero-free on D.If fn≠hn, then {fn} is normal on D.     

Ramanujan — Fourier series and a theorem of Ingham

Given two arithmetical functions f, g, we derive, under suitable conditions, asymptotic formulas for the convolution sums ∑ _n≤N f (n) _g (n + h) for a fixed number h. To this end, we develop the theory of Ramanujan expansions for arithmetical functions. Our results give new proofs of some old results of Ingham proved by him in 1927 using different techniques.     

Functions with derivatives given by polynomials in the function itself or a related function

We construct the set of holomorphic functions S ₁ = {f: Ω_f ? ? → ?} whose members have n-th order derivatives which are given by a polynomial of degree n+1 in the function itself. We also construct the set of holomorphic functions S ₂ = {g: Ω_g ? ? → ?} whose members have n-th order derivatives which are given by the product of the function itself with a polynomial of degree n in an element of S ₁. The union S ₁ ∪ S ₂ contains all the hyperbolic and trigonometric functions. We study the properties of the polynomials involved and derive explicit expressions for them. As particular results, we obtain explicit and elegant formulas for the n-th order derivatives of the hyperbolic functions tanh, sech, coth and csch and the trigonometric functions tan, sec, cot and csc.     

On the representation of functions as a sum of derivatives

We show that there is an integrable function g of two variables which cannot be represented as a sum g = f₀ + ∂f₁ + ∂₂f₂, where f₀,f₁,f₂ are functions with integrable gradient.     

The forcing hull and forcing geodetic numbers of graphs

For every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. For a graph G, let I_G[u,v] denote the set of all vertices lying on a u-v geodesic. Let S⊆V(G) and I_G[S] denote the union of all I_G[u,v] for all u,v∈S. A subset S⊆V(G) is a convex set of G if I_G[S]=S. A convex hull [S]_G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]_G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if I_G[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset F⊆V(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number f_h(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number f_g(G) of G. In the paper, we construct some 2-connected graph G with (f_h(G),f_g(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+b≥2, there exists a 2-connected graph G with (f_h(G),f_g(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81-94].     

Using Stepanov's method for exponential sums involving rational functions

For any additive character ψ and multiplicative character χ on a finite field F_q, and rational functions f,g in F_q(x), we show that the elementary Stepanov-Schmidt method can be used to obtain the corresponding Weil bound for the sum ∑_x∈Fq?Sχ(g(x))ψ(f(x)) where S is the set of the poles of f and g. We also determine precisely the number of characteristic values ω_i of modulus q^1/2 and the number of modulus 1.     

An exact Jacobian SDP relaxation for polynomial optimization

Given polynomials f (x), g _i (x), h _j (x), we study how to minimize f (x) on the set $$S = \left\{ x \in \mathbb{R}^n:\, h_1(x) = \cdots = h_{m_1}(x) = 0,\\ g_1(x)\geq 0, \ldots, g_{m_2}(x) \geq 0 \right\}.$$ Let f _min be the minimum of f on S. Suppose S is nonsingular and f _min is achievable on S, which are true generically. This paper proposes a new type semidefinite programming (SDP) relaxation which is the first one for solving this problem exactly. First, we construct new polynomials ${\varphi_1, \ldots, \varphi_r}$ , by using the Jacobian of f, h _i , g _j , such that the above problem is equivalent to $$\begin{gathered}\underset{x\in\mathbb{R}^n}{\min} f(x) \hfill \\ \, \, {\rm s.t.}\; h_i(x) = 0, \, \varphi_j(x) = 0, \, 1\leq i \leq m_1, 1 \leq j \leq r, \hfill \\ \quad \, \, \, g_1(x)^{\nu_1}\cdots g_{m_2}(x)^{\nu_{m_2}}\geq 0, \, \quad\forall\, \nu \,\in \{0,1\}^{m_2} .\hfill \end{gathered}$$ Second, we prove that for all N big enough, the standard N-th order Lasserre’s SDP relaxation is exact for solving this equivalent problem, that is, its optimal value is equal to f _min. Some variations and examples are also shown.     

Equality of two-variable functional means generated by different measures

We consider two-variable functional means of the form $$M_{f,g;\mu}(x,y) := \left(\frac{f}{g}\right)^{-1}\left(\frac{\int\nolimits_{[0,1]} f(tx+(1-t)y)\,d\mu(t)}{\int\nolimits_{[0,1]}g(tx+(1-t)y)\,d\mu(t)}\right),$$ where f, g are continuous functions on a real interval such that g is positive, f/g is strictly monotonic and??? is a measure over the Borel sets of [0,1]. The main results concern the functional equation M _f,g;?? ?=?M _f,g;?? for the unknown functions f, g, where??? and ?? are given measures. Depending on the symmetry properties of the measures, various necessary conditions and sufficient conditions are established.     

Complexity of sequential computations of partial Boolean functions by circuits

A pair (f, g) of partial Boolean functions is characterized by a tuple of parameters l _αβ that is the number of tuples $ \tilde x A pair (f, g) of partial Boolean functions is characterized by a tuple of parameters l _αβ that is the number of tuples such that (f( ), g( )) = (α, β), where α and β take the values 0, 1, and an undefined value. The sequential computation of (f, g) is considered when a circuit S _f for f is constructed first, and, next, it is completed by the construction up to a circuit S _f,g . It is shown that if the domain D(f) includes D(g) then it is possible to compute sequentially f and g in such a way that S _f and S _f,g are asymptotically minimal simultaneously (i.e., they satisfy the asymptotically best bounds on the complexity for corresponding classes); and, in general, these functions cannot be sequentially computed in the order g, f so that S _g and S _f,g are asymptotically minimal. An attainable lower bound is obtained on the size of the circuit S _f,g for the sequential computation. The information properties of partially defined data play an essential role whose study in the previous papers of the author is continued here. Original Russian Text ? L.A. Sholomov, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 1, pp. 110–139.     

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.     

Exact rates in density support estimation

Let f be an unknown multivariate probability density with compact support S_f. Given n independent observations X₁,…,X_n drawn from f, this paper is devoted to the study of the estimator of S_f defined as unions of balls centered at the X_i and of common radius r_n. To measure the proximity between and S_f, we employ a general criterion d_g, based on some function g, which encompasses many statistical situations of interest. Under mild assumptions on the sequence (r_n) and some analytic conditions on f and g, the exact rates of convergence of are obtained using tools from Riemannian geometry. The conditions on the radius sequence are found to be sharp and consequences of the results are discussed from a statistical perspective.     

Sets of periods for automorphisms of compact Riemann surfaces

Let G=〈f〉 be a finite cyclic group of order N that acts by conformal automorphisms on a compact Riemann surface S of genus g≥2. Associated to this is a set A of periods defined to be the subset of proper divisors d of N such that, for some x∈S, x is fixed by f^d but not by any smaller power of f. For an arbitrary subset A of proper divisors of N, there is always an associated action and, if g_A denotes the minimal genus for such an action, an algorithm is obtained here to determine g_A. Furthermore, a set A_max is determined for which g_A is maximal.     

Univalence criterion and convexity for an integral operator

For analytic functions f and g in the open unit disk U, a new integral operator I₁(f,g)(z) is introduced. The main object of this paper is to obtain a univalence condition and the order of convexity for the integral operator I₁(f,g)(z).     

A Leibniz differentiation formula for positive operators

Is is shown that for n→+∞ the Leibnizian combination L′_n(fg)−fL′_n(g)−gL′_n(f) converges uniformly to zero on a compact interval W if the positive operators L_n belong to a certain class (including Bernstein, Gauss-Weierstrass and many others), and if the moduli of continuity of f,g satisfy ω_W(f;h)ω_W(g;h)=o(h) as h→0+. A counterexample shows that Lipschitz conditions are not appropriate to bring about a second-order version of this formula.