[PDF] Top 20 Extremal problems related to convexity

... To give some background, in order to motivate why we should study at all questions such as those addressed in the theorems of the previous section, we review some literature and results that give rise to questions on ... See full document

... closely related to problems in extremal combinatorics and they correspond to unique extremal configurations of problems from extremal graph ...Indeed, extremal graph ... See full document

... The bounds obtained are used to derive the distortion theorems, the covering theorems and the radii of convexity for the classes of regular or meromorphic starlike functions associated w[r] ... See full document

... (ii ) Let C > 0 be a sufficiently large absolute constant. If a set P of n points in R 2 spans more than 24 1 n 3 − 24 7 n 2 + Cn 4-rich circles, then up to an inversion, P lies on a ellipse or a circular elliptic ... See full document

... In this present investigation, by considering an order- ing relation on the quotient space of fuzzy numbers, we have presented the concepts of convexity, quasiconvexity and pseudoconvexity for fuzzy mappings [19]. ... See full document

... Graph theory has now become a major branch of applied mathematics and generally regarded as a branch of Combinatorics. Graph theory is a widely used tool for solving a combinatorial problem in different areas such as ... See full document

... Chapter 2 is about a result related to the Sidorenko conjecture. The Sidorenko conjec- ture was asked by Sidorenko [24], and also by Erdos and Simonovits [26]. It states that if G is a bipartite graph with e(G) ... See full document

... Extremal Problems Related to Dual Gauss-John Position Tongyi Ma College of Mathematics and Statistics, Hexi University, Zhangye, China.. How to cite this paper: Ma, T.Y.[r] ... See full document

... We prove positive semidefiniteness of matrices generated by differences deduced from majorization-type results which implies exponential convexity and log-convexity of these differences and also obtain ... See full document

... In the last few years, much attention has been paid to optimality conditions and duality theorems for the minimax fractional programming problems. For the case of convex dif- ferentiable minimax fractional ... See full document

... □ As expected, all three formulas give the same value of 108 for n = 2. It is clear from the leading coefficients that for long regular chains the para-chain has the largest and the ortho-chain the smallest eccentric ... See full document

... equilibrium problems with generalized ...equilibrium problems are ...equilibrium problems is ...optimization problems and vector variational inequality problems with ... See full document

... In this paper, p-biharmonic equations involving Hardy potential and negative exponents with a parameter λ are considered. By means of the structure and properties of Nehari manifold, we give uniform lower bounds for Λ ... See full document

... solutions regular problems , and we give some examples. In Section 4 we show that looking for piecewise continuous lower and upper solutions is good in practice, but once we have found them we can immediately ... See full document

... Keywords Maximum Edge-Disjoint Cycle Packing, Extremal Problems in Graph Theory, Dynamic Programming, A* -Shortest Path Procedure... An Eulerian graph is a connected even graph.[r] ... See full document

... This paper is concerned with the existence of extremal solutions of periodic boundary value problems for second-order impulsive integro-differential equations with integral jump conditions. We introduce a ... See full document

... Schur-convexity was introduced by Schur in 1923. Since then many researchers have de- voted their efforts to it; see for example [6, 8, 12, 17, 19]. Schur-convexity has many impor- tant applications in ... See full document

... On the other hand, a considerable and growing interest has been centered about studying the relationship between vector optimization problems and vector variational inequalities. In particular, many results ... See full document

... [1] A. Acker, On the uniqueness, monotonicity, starlikeness, and convexity of solutions for a nonlinear boundary value problem in elliptic PDEs, Nonlinear Analysis. Theory, Methods & Applications. An ... See full document

... maximum cardinality of a proper weak convex set of G , wcon ( G ) = max { S / S is a weak convex set of G and S ≠ V (G )} . These type of sets are already called isometric sets. We prefer to use the term weak convex sets ... See full document