相关论文: Bead sliding and convex inequalities

We introduce a notion of convex hull and polytope into adele space. This allows to consider adelic triangulations which, in particular, lead to an adelic blichfeldt-type inequality, complementing former results.

A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…

We propose a notion of concavity in two-sided many-to-one matching, which is an analogue to the balancedness condition in cooperative games. A stable matching exists when the market is concave. We provide a class of concave markets. In the…

We study bounded domains with certain smoothness conditions and the properties of their squeezing functions in order to prove that the domains are biholomorphic to the ball.

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…

This paper deals with more refinements of inequalities related to deviations from Mean Value involving superquadratic and uniformly convex functions.

The recently proposed (Phys. Rev. A90 (2014), 062121 and Phys. Rev. A91 (2015), 052110) group theoretical approach to the problem of breaking the Bell inequalities is applied to $S_4$ group. The Bell inequalities based on the choice of…

We give a beautiful explicit example of a convex plane curve such that the outer billiard has a given finite number of invariant curves. Moreover, the dynamics on these curves is a standard shift. This example can be considered as an outer…

Matrix inequalities that extend certain scalar ones have been at the center of numerous researchers' attention. In this article, we explore the celebrated subadditive inequality for matrices via concave functions and present a reversed…

Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…

This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through…

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the constraints that optimal solutions need to satisfy, and…

Equivalencies of many basic elementary inequalities are given

In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…

In this talk, some aspects of duality symmetries are presented.

We introduce Cut-and-Play, a practically-efficient algorithm for computing Nash equilibria in simultaneous non-cooperative games where players decide via nonconvex and possibly unbounded optimization problems with separable payoff…

We investigate a one-dimensional model describing the motion of liquid drops sliding down an inclined plane (the so-called quasi-static approximation model). We prove existence and uniqueness of a solution and investigate its long time…

In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.

We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-forward, and…

We investigate some natural probability distributions associated with the game of matroid bingo.