Related papers: Bead sliding and convex inequalities
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
We study the shifted convolution sum of the divisor function and some other arithmetic functions.
We present Molecular Dynamics simulations of one- and two-dimensional bead-spring models sliding on incommensurate substrates. We investigate how sliding friction is affected by interaction anharmonicity and structural defects. In their…
We consider composite loss functions for multiclass prediction comprising a proper (i.e., Fisher-consistent) loss over probability distributions and an inverse link function. We establish conditions for their (strong) convexity and explore…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
In this article we proved an interesting property of the class of continuous convex functions. This leads to the form of pre-Hermite-Hadamard inequality which in turn admits a generalization of the famous Hermite-Hadamard inequality. Some…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
Min-max saddle point games appear in a wide range of applications in machine leaning and signal processing. Despite their wide applicability, theoretical studies are mostly limited to the special convex-concave structure. While some recent…
Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…
We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…
Using a mixture of classical and probabilistic techniques we investigate the convexity of solutions to the elliptic pde associated with a certain generalized Ornstein-Uhlenbeck process.
The relation between the boolean functions and Bell inequalities for qubits is analyzed. The connection between the maximal quantum violation of a Bell inequality and the nonlinearity of the corresponding boolean function is discussed. A…
In this paper, new inequalities connected with the celebrated Steffensen's integral inequality are proved.
We state Bennequin inequalities in the relative case, and show that the relative invariants are additive under relative connected sums. We show they exhibit similar limitations as their classical analogues. We study relatively Legendrian…
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle…
In this paper, we investigate stochastic continuity (with respect to the initial value), irreducibility and non confluence property of the solutions of stochastic differential equations with jumps. The conditions we posed are weaker than…
We study rubber sliding friction on hard lubricated surfaces. We show that even if the hard surface appears smooth to the naked eye, it may exhibit short wavelength roughness, which may give the dominant contribution to rubber friction.…
We prove local inequalities for analytic functions defined on a convex body in $\Re^{n}$ which generalize well-known classical inequalities for polynomials.