Consider L being a continuous lattice, two functors from the category of convex spaces (denoted by CS) to the category of stratified L-convex spaces (denoted by SL-CS) are defined. The first functor enables us to prove that the category CS can be embedded in the category SL-CS as a reflective subcategory. The second functor enables us to prove that the category CS can be embedded in the categor...

It is shown that every equi-affine invariant and upper semicontinuous valuation on the space of convex discs is a linear combination of the Euler characteristic, area, and affine length. Asymptotic formulae for approximation of convex discs by polygons are derived, extending results of L. Fejes Tóth from smooth convex discs to general convex discs. 1991 AMS subject classification: 52A10, 53A15,...

The theorem of Jung establishes a relation between circumradius and diameter of a convex body. The half of the diameter can be interpreted as the maximum of circumradii of all 1-dimensional sections or 1-dimensional orthogonal projections of a convex body. This point of view leads to two series of j-dimensional circumradii, defined via sections or projections. In this paper we study some relati...

This paper is concerned with the algebraic K-theory of locally convex C-algebras stabilized by operator ideals, and its comparison with topological K-theory. We show that if L is locally convex and J a Fréchet operator ideal, then all the different variants of topological K-theory agree on the completed projective tensor product L⊗̂J , and that the obstruction for the comparison map K(L⊗̂J ) → K(...

This theorem is similar to the well known result that any point in the convex hull of a set E in an w-dimensional euclidean space lies in the convex hull of some subset of E containing at most n-\-l points [l, 2 ] . 1 In these theorems the set E is an arbitrary set in the space. The convex hull of E, denoted by H(E), is the set product of all convex sets in the space which contain E. A euclidea...

In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank pen...

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but the problem is PSPACE-hard if L is represented by an NFA. If a regular language is not convex, we prove tight u...

This is a survey of algorithmic results in the theory of “discrete convex analysis” for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, the Fenchel min-max duality, and separation theorems. The technical development is based on matroid-theoretic concepts, in ...

Let H(k, l) denote the smallest integer such that any set of H(k, l) points in the plane, no three on a line, contains an empty convex k-gon and an empty convex l-gon, which are disjoint, that is, their convex hulls do not intersect. Hosono and Urabe [JCDCG, LNCS 3742, 117-122, 2004] proved that 12 ≤ H(4, 5) ≤ 14. Very recently, using a Ramsey-type result for disjoint empty convex polygons prov...