A sufficient condition for the convexity of the area of an isoptic curve of an oval
A supplement to Eddy's paper.
A survey of Sylvester's problem and its generalizations.
A survey on local cohomology and 𝓓-modules
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
Consider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games. Similarly, the well-known state-labeling algorithm used in model checking can be viewed as computing optimal paths on a Kripke structure, where each path has a minimum number of transitions. We exploit these similarities in a common generalization of extensive games and Kripke structures that we name “graph games”. By extending...
A systematization of convexity concepts for sets and functions.
A theorem on nonexistence of a certain type of nearly regular cell-decompositions of the sphere
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets.
A typical convex surface contains no closed geodesic.
A Unified Theory of Proportion
A Unified Theory of Proportion
A unified treatment of the theories of matroids with coefficients and of -matroids with coefficients.
A universal convex set in Euclidean space
A universal convex set in Euclidean space
A weighted geometric inequality and its applications.
Abelian groups that cannot be factored without periodic factor
About a problem of Ulam concerning flat sections of manifolds.
About an inequality of Kubota for plane convex figures.
About some Riemann surfaces and plane tilings.
About the domino problem in the hyperbolic plane from an algorithmic point of view
This paper is a contribution to the general tiling problem for the hyperbolic plane. It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264] and the conjecture that the problem is undecidable.