相关论文: Bead sliding and convex inequalities

The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Starting from the recently proposed proximal variant of the extragradient method for this class…

Subaddivity type matrix inequalities for concave funcions and symetric norms are given.

We review sandwich theorems from the theory of convex functions.

A nonlinear inequality is formulated in the paper. An estimate of the rate of decay of solutions to this inequality is obtained. This inequality is of interest in a study of dynamical systems and nonlinear evolution equations. It can be…

The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…

The "variance method" has been used to prove many classical inequalities in design theory and coding theory. The purpose of this expository note is to review and present some of these inequalities in a unified setting. I will also discuss…

We generalize the notion of convexity and average-convexity to the notion of weighted average-convexity. We show several results on the relation between weighted average-convexity and cooperative games. First, we prove that if a game is…

We study classical and quantum dynamics of a particle in a circular billiard with a straight cut. This system can be integrable, nonintegrable with soft chaos, or nonintegrable with hard chaos, as we vary the size of the cut. We use a…

In this paper, we establish some integral ineuqalities for n- times differentiable convex functions.

Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted…

In this paper, we introduce a bilevel optimization framework for addressing inverse mean-field games, alongside an exploration of numerical methods tailored for this bilevel problem. The primary benefit of our bilevel formulation lies in…

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…

We extend Freiman's inequality on the cardinality of the sumset of a $d$ dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.

We study certain double--series inequalities, which are motivated by weighted Hardy inequalities.

We analyze a variety of Weyl invariant dynamical problems in three dimensions.

In this article, we obtain two interesting general inequalities concerning Riemman sums of convex functions, which in particular, sharpen Alzer's inequality and give a suitable converse for it.

In this paper, a new class of convex functions as a generalization of convexity which is called (h-m)-convex functions and some properties of this class is given. We also prove some Hadamard's type inequalities.

In this thesis, we survey techniques and results from the study of Complexity Theory and Games. We then apply these techniques to obtain new results for previously unstudied games. Our contributions in the games Hexiom, Cut the Rope, and…

We study local convexity properties of the triangular ratio metric balls in proper subdomains of the real coordinate space. We also study inclusion properties of the visual angle metric balls and related hyperbolic type metric balls in the…

In this study, the author establish 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.