Some remarks ons-convex functions

Summary Two kinds ofs-convexity (0 <s 1) are discussed. It is proved among others thats-convexity in the second sense is essentially stronger than thes-convexity in the first, original, sense whenever 0 <s < 1. Some properties ofs-convex functions in both senses are considered and various examples and counterexamples are given.     

Characterizations of <Emphasis Type="Italic">r</Emphasis>-Convex Functions

This paper discusses some properties of r-convexity and its relations with some other types of convexity. A characterization of convex functions in terms of r-convexity is given without assuming differentiability. The concept of strict r-convexity is introduced. For a twice continuously differentiable function f, it is shown that the strict r-convexity of f is equivalent to a certain condition on ∇ ² f. Further, it is shown that this condition is satisfied by quasiconvex functions satisfying a less stringent condition.     

Some Hadamard-Like Inequalities via Convex and s-Convex Functions and their Applications for Special Means

In this study, the author establishes some inequalities of Hadamard-like based on convex and s-convexity in the second sense. Some applications to special means of positive real numbers are also given.     

Piecewise Constant Roughly Convex Functions

This paper investigates some kinds of roughly convex functions, namely functions having one of the following properties: -convexity (in the sense of Klötzler and Hartwig), -convexity and midpoint -convexity (in the sense of Hu, Klee, and Larman), -convexity and midpoint -convexity (in the sense of Phu). Some weaker but equivalent conditions for these kinds of roughly convex functions are stated. In particular, piecewise constant functions satisfying f(x) = f([x]) are considered, where [x] denotes the integer part of the real number x. These functions appear in numerical calculation, when an original function g is replaced by f(x):=g([x]) because of discretization. In the present paper, we answer the question of when and in what sense such a function f is roughly convex.     

Convexities of metric spaces

We introduce two kinds of the notion of convexity of a metric space, called k-convexity and L-convexity, as generalizations of the CAT(0)-property and of the nonpositively curved property in the sense of Busemann, respectively. 2-uniformly convex Banach spaces as well as CAT(1)-spaces with small diameters satisfy both these convexities. Among several geometric and analytic results, we prove the solvability of the Dirichlet problem for maps into a wide class of metric spaces.      

Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity

In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems.     

Singular Probability Distributions and Fractal Properties of Sets of Real Numbers Defined by the Asymptotic Frequencies of Their <Emphasis Type="Italic">s</Emphasis>-Adic Digits

Properties of the set T _s of “particularly nonnormal numbers” of the unit interval are studied in detail (T _s consists of real numbers x some of whose s-adic digits have the asymptotic frequencies in the nonterminating s-adic expansion of x, and some do not). It is proved that the set T _s is residual in the topological sense (i.e., it is of the first Baire category) and is generic in the sense of fractal geometry (T _s is a superfractal set, i.e., its Hausdorff-Besicovitch dimension is equal to 1). A topological and fractal classification of sets of real numbers via analysis of asymptotic frequencies of digits in their s-adic expansions is presented. Dedicated to V. S. Korolyuk on occasion of his 80th birthday __________ Published in Ukrains'kyi Matematychnyi Zhurnal, Vol. 57, No. 9, pp. 1163–1170, September, 2005.     

Optimally small sumsets in groups IV. Counting multiplicities and the <Emphasis Type="Italic">λ</Emphasis><Subscript><Emphasis Type="Italic">G</Emphasis></Subscript> functions

We continue our investigation on how small a sumset can be in a given abelian group. Here small takes into account not only the size of the sumset itself but also the number of elements which are repeated at least twice. A function λ _G (r, s) computing the minimal size (in this sense) of the sum of two sets with respective cardinalities r and s is introduced. (Lower and upper) bounds are obtained, which coincide in most cases. While upper bounds are obtained by constructions, lower bounds follow in particular from the use of a recent theorem by Grynkiewicz.     

Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity

In this paper, we present necessary optimality conditions for nondifferentiable minimax fractional programming problems. A new concept of generalized convexity, called (C, α, ρ, d)-convexity, is introduced. We establish also sufficient optimality conditions for nondifferentiable minimax fractional programming problems from the viewpoint of the new generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of dual programs. This research was partially supported by NSF and Air Force grants     

A new class of convex games on <Emphasis Type="Italic">σ</Emphasis>-algebras and the optimal partitioning of measurable spaces

We introduce μ-convexity, a new kind of game convexity defined on a σ-algebra of a nonatomic finite measure space. We show that μ-convex games are μ-average monotone. Moreover, we show that μ-average monotone games are totally balanced and their core contains a nonatomic finite signed measure. We apply the results to the problem of partitioning a measurable space among a finite number of individuals. For this problem, we extend some results known for the case of individuals’ preferences that are representable by nonatomic probability measures to the more general case of nonadditive representations.     

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

Let r and s be nonnegative integers, and let G be a graph of order at least 3r + 4s. In Bialostocki et al. (Discrete Math 308:5886–5890, 2008), conjectured that if the minimum degree of G is at least 2r + 3s, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles, and they showed that the conjecture is true for r = 0, s = 2 and for s = 1. In this paper, we settle this conjecture completely by proving the following stronger statement; if the minimum degree sum of two nonadjacent vertices is at least 4r + 6s−1, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles.     

Random data Cauchy theory for supercritical wave equations I: local theory

We study the local existence of strong solutions for the cubic nonlinear wave equation with data in H ^s (M), s<1/2, where M is a three dimensional compact Riemannian manifold. This problem is supercritical and can be shown to be strongly ill-posed (in the Hadamard sense). However, after a suitable randomization, we are able to construct local strong solution for a large set of initial data in H ^s (M), where s≥1/4 in the case of a boundary less manifold and s≥8/21 in the case of a manifold with boundary. Mathematics Subject Classification (2000)  35Q55, 35BXX, 37K05, 37L50, 81Q20     

Coxeter–Petrie Complexes of Regular Maps

Coxeter–Petrie complexes naturally arise as thin diagram geometries whose rank 3 residues contain all of the dual forms of a regular algebraic map M. Corresponding to an algebraic map is its classical dual, which is obtained simply by interchanging the vertices and faces, as well as its Petrie dual, which comes about by replacing the faces by the so-called Petrie polygons. Jones and Thornton have shown that these involutory duality operations generate the symmetric groupS₃ , giving in all six dual forms, and whose source is the outer automorphism group of the infinite triangle group generated by involutions s₁, s₂, s₃, subject to the additional relation s₁s₃ =  s₃s₁. In fact, this outer automorphism group is parametrized by the permutations of the three commuting involutions s₁,s₃ , s₁s₃. These involutions together with the involutions₂ can be taken to define the nodes of a Coxeter diagram of shape D₄(with the involution s₂at the central node), and when the original map M is regular, there is a natural extension from M to a thin Coxeter complex of rank 4 all of whose rank 3 residues are isomorphic to the various dual forms of M. These are fully explicated in case the original algebraic map is a Platonic map.     

Non‐uniform dependence and persistence properties for coupled Camassa–Holm equations

This paper deals with the non‐uniform dependence and persistence properties for a coupled Camassa–Holm equations. Using the method of approximate solutions in conjunction with well‐posedness estimate, it is proved that the solution map of the Cauchy problem for this coupled Camassa–Holm equation is not uniformly continuous in Sobolev spaces H^s with s > 3/2. On the other hand, the persistence properties in weighted L^p spaces for the solution of this coupled Camassa–Holm system are considered. Copyright © 2016 John Wiley & Sons, Ltd.     

<Emphasis Type="Italic">k</Emphasis>*-Metrizable spaces and their applications

In this paper, we introduce and study a new class of generalized metric spaces, which we call k*-metrizable spaces, and suggest various applications of such spaces in topological algebra, functional analysis, and measure theory. By definition, a Hausdorff topological space X is k*-metrizable if X is the image of a metrizable space M under a continuous map f: M → X which has a section s: X → M preserving precompact sets in the sense that the image s(K) of any compact set K ⊂ X has compact closure in X. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 48, General Topology, 2007.     

Symplectic semifield spreads of <Emphasis Type="Italic">PG</Emphasis>(5, <Emphasis Type="Italic">q</Emphasis>) and the veronese surface

In this paper we show that starting from a symplectic semifield spread S{\mathcal{S}} of PG(5, q), q odd, another symplectic semifield spread of PG(5, q) can be obtained, called the symplectic dual of S{\mathcal{S}}, and we prove that the symplectic dual of a Desarguesian spread of PG(5, q) is the symplectic semifield spread arising from a generalized twisted field. Also, we construct a new symplectic semifield spread of PG(5, q) (q = s ², s odd), we describe the associated commutative semifield and deal with the isotopy issue for this example. Finally, we determine the nuclei of the commutative pre-semifields constructed by Zha et al. (Finite Fields Appl 15(2):125–133, 2009).     

Split Short Five Lemma for Clots and Subtractive Categories

It is well-known that a pointed variety is classically ideal determined (or “BIT speciale”) if and only if it satisfies the split short five lemma (i.e. if and only if it is a protomodular category in the sense of D. Bourn). A much weaker property than being classically ideal determined is “subtractivity”, defined as follows: a variety with a constant 0 is said to be subtractive if its theory contains a binary term s satisfying s(x,x) = 0 and s(x,0) = x. In the case of a pointed variety (i.e. when 0 is the unique constant), this condition can be reformulated purely categorically (as many other similar term conditions), which gives rise to the notion of a subtractive category. In the present paper we show that in a certain general categorical context subtractivity is equivalent to a special restriction of the split short five lemma to the class of clots, i.e. monomorphisms that are pullbacks of reflexive relations R→Y×Y along product injections (1 _Y ,0): Y→Y×Y.     

Mellin‐edge representations of elliptic operators

We construct a class of elliptic operators in the edge algebra on a manifold M with an embedded submanifold Y interpreted as an edge. The ellipticity refers to a principal symbolic structure consisting of the standard interior symbol and an operator‐valued edge symbol. Given a differential operator A on M for every (sufficiently large) s we construct an associated operator ??_s in the edge calculus. We show that ellipticity of A in the usual sense entails ellipticity of ??_s as an edge operator (up to a discrete set of reals s). Parametrices P of A then correspond to parametrices ??_s of ??_s, interpreted as Mellin‐edge representations of P. Copyright © 2005 John Wiley & Sons, Ltd.     

Canonical and monophonic convexities in hypergraphs

Known properties of “canonical connections” from database theory and of “closed sets” from statistics implicitly define a hypergraph convexity, here called canonical convexity (c-convexity), and provide an efficient algorithm to compute c-convex hulls. We characterize the class of hypergraphs in which c-convexity enjoys the Minkowski-Krein-Milman property. Moreover, we compare c-convexity with the natural extension to hypergraphs of monophonic convexity (or m-convexity), and prove that: (1) m-convexity is coarser than c-convexity, (2) m-convexity and c-convexity are equivalent in conformal hypergraphs, and (3) m-convex hulls can be computed in the same efficient way as c-convex hulls.     

$${\cal K}$$-Convexity1 in $$\Re^{n}$$

We generalize the concept of K-convexity to an n-dimensional Euclidean space. The resulting concept of -convexity is useful in addressing production and inventory problems where there are individual product setup costs and/or joint setup costs. We derive some basic properties of -convex functions. We conclude the paper with some suggestions for future research. Support from Columbia University and University of Texas at Dallas is gratefully acknowledged. Helpful comments from Qi Feng are appreciated.