Modulus and characteristic of convexity
Semantic Scholar uses AI to extract papers important to this topic.
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n… Expand Zero point problems of two accretive operators and fixed point problems of a nonexpansive mappings are investigated based on a… Expand We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a… Expand We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spec… Expand We consider convex sets whose modulus of convexity is uniformly quadratic. First, we observe several interesting relations… Expand The design of linear transceivers for multiple-input-multiple-output (MIMO) communication systems with channel state information… Expand It is shown that every symmetric convex body which satisfies a kind of weak law of large numbers has the property that almost all… Expand Some relations between the James (or non-square) constant $J(X)$ and the Jordan-von Neumann constant $C_NJ(X),$ and the normal… Expand This note shows that convexity cuts defined relative to polyhedral convex sets can utilize negative as well as positive edge… Expand There is a uniformly convex Banach space with unconditional basis which contains no subspace isomorphic to any lp (1 p ~). The… Expand