Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...
CONVEXITY OF LEVEL SETS FOR ELLIPTIC PROBLEMS IN CONVEX DOMAINS OR CONVEX RINGS: TWO COUNTEREXAMPLES
American Journal of Mathematics, Vol. 138, No. 2 (April 2016), pp. 499-527 (29 pages) This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded ...
If $V$ is a vector space over an ordered division ring, $C$ a convex subset of $V$ and $L$ the lattice of convex subsets of $C$, then we call $L$ a convexity lattice ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback