‎In this paper‎, ‎we shall establish some extended Simpson-type inequalities‎ ‎for differentiable convex functions and differentiable concave functions‎ ‎which are connected with Hermite-Hadamard inequality‎. ‎Some error estimates‎ ‎for the midpoint‎, ‎trapezoidal and Simpson formula are also given‎.

A function F defined on all subsets of a finite ground set E is quasiconcave if F (X∪Y ) ≥ min{F (X), F (Y )} for all X, Y ⊂ E. Quasi-concave functions arise in many fields of mathematics and computer science such as social choice, theory of graph, data mining, clustering and other fields. The maximization of quasi-concave function takes, in general, exponential time. However, if a quasi-concav...

In this paper we prove the following results concerning the product f1f2 of two concave functions f1and f2 defined in a non empty, compact, convex set K of R. The first result states that necessary and sufficient condition for the product f1f2 of two linear affine functions to be concave is that they are Gonzi. Finally the main result says that a necessary and sufficient condition for the produ...

We prove new entropy inequalities for log concave and s-concave functions that strengthen and generalize recently established reverse log Sobolev and Poincaré inequalities for such functions. This leads naturally to the concept of f -divergence and, in particular, relative entropy for s-concave and log concave functions. We establish their basic properties, among them the affine invariant valua...

Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo a of the number of concave compositions. Let c(n) be the number of concave compositions of n having even length. It is easy to see that c(n) is even for all n 1. Refining this fact, we prove that #{n < X : c(n) ⌘ 0 (mod 4)} p X and also that for every a > 2 and at leas...

We consider resource allocation with separable objective functions defined over subranges of the integers. While it is well known that (the maximization version of) this problem can be solved efficiently if the objective functions are concave, the general problem of resource allocation with non-concave functions is difficult. In this article we show that for fairly well-shaped non-concave objec...