On the Geometry of Locally Nonconical Convex Sets

A convex subset Q of a Hausdorff topological vector space is called locally nonconical (LNC) if for every two points x,yQ there is a relative neighborhood U of x in Q such that U+ (y-x) Q. A geometric characterization (Theorem 2.2) of closed LNC sets with nonempty interior in a Hilbert space is supplied. It states that any proper line segment ]x,y[ contained in bd(Q), the topological boundary of Q, lies inside a relative neighborhood in bd(Q) composed of parallel line segments. It is shown that one half of this characterization, at least, generalizes to the setting of a locally convex Hausdorff topological vector space (LCHTVS). This leads to the observation that the set ext(Q) of extreme points of any LNC set Q in an LCHTVS is closed. Finally, it is proven that, in the same setting, all LNC sets are uniformly stable and, hence, stable.     

Lokalkonvexe Unterräume in Topologischen Vektorräumen und Das ε-Produkt

It is well-known that the algebraic tensor product E Y of a not necessarily locally convex topological vector space E and a locally convex space Y can be identified with a subspace of the so-called -product EY (a space of continuous linear mappings from Y into E). So, whenever EY is complete, even the completed tensor product is (isomorphic to) a subspace of EY. As this occurs in many important cases, it is interesting to remark that, for each continuous linear operator u from a locally convex space F into E, there exists a locally convex U with continuous embedding jUE and a continuous linear map ûFU such that u=j·û. As main applications of a combination of these ideas, we obtain a characterization of the functions in as continuous functions with values in locally convex spaces (this gives new aspects for the intergration theory of Gramsch [5]) and a result extending a theorem in [6] on holomorphic functions with values in non locally convex spaces to arbitrary complex manifolds.     

Some Characterization of Locally Nonconical Convex Sets

A closed convex set Q in a local convex topological Hausdorff spaces X is called locally nonconical (LNC) if for every x, y Q there exists an open neighbourhood U of x such that . A set Q is local cylindric (LC) if for x, y Q, x y, z (x, y) there exists an open neighbourhood U of z such that U Q (equivalently: bd(Q) U) is a union of open segments parallel to [x, y]. In this paper we prove that these two notions are equivalent. The properties LNC and LC were investigated in [3], where the implication LNC LC was proved in general, while the inverse implication was proved in case of Hilbert spaces.     

Folgenkonvexe funktionen

In this paper functions f:(a,b)R are considered with the property that for all n>2 and all x₁,x₂,...,x_n(a,b) is convex in k. Functions with this property are called sequentially convex. It is proved that if f is convex, twice differentiable, and f is convex then f is sequentially convex. In case f is a continous function defined on the whole ofR these conditions are necessary too.     

Generating and Enumerating Digitally Convex Sets of Trees

A set S of vertices in a graph G with vertex set V is digitally convex if for every vertex \(v \in V\), \(N[v] \subseteq N[S]\) implies \(v \in S\). We show that a vertex belongs to at most half of the digitally convex sets of a graph. Moreover, a vertex belongs to exactly half of the digitally convex sets if and only if it is simplicial. An algorithm that generates all digitally convex sets of a tree is described and sharp upper and lower bounds for the number of digitally convex sets of a tree are obtained. A closed formula for the number of digitally convex sets of a path is derived. It is shown how a binary cotree of a cograph can be used to enumerate its digitally convex sets in linear time.     

Measuring the tameness of almost convex groups

A 1-combing for a finitely presented group consists of a continuous family of paths based at the identity and ending at points in the 1-skeleton of the Cayley 2-complex associated to the presentation. We define two functions (radial and ball tameness functions) that measure how efficiently a 1-combing moves away from the identity. These functions are geometric in the sense that they are quasi-isometry invariants. We show that a group is almost convex if and only if the radial tameness function is bounded by the identity function; hence almost convex groups, as well as certain generalizations of almost convex groups, are contained in the quasi-isometry class of groups admitting linear radial tameness functions.

     

Shortest paths on convex hypersurfaces of Riemannian spaces

A convex hypersurface in a Riemannian space M^m is part of the boundary of an m-dimensional locally convex set. It is established that there exists an intrinsic metric of such a hypersurface and it has curvature which is bounded below in the sense of A. D. Aleksandrov; curves with bounded variation of rotation in are shortest paths in M^m. For surfaces in R^m these facts are well known; however, the constructions leading to them are in large part inapplicable to spaces M^m. Hence approximations to by smooth equidistant (not necessarily convex) ones and normal polygonal paths, introduced (in the case of R³) by Yu. F. Borisov are used.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 66, pp. 114–132, 1976.     

On convex iterative roots of non-monotonic mappings

Let I be an interval. We consider the non-monotonic convex self-mappings \(f:I\rightarrow I\) such that \(f^2\) is convex. They have the property that all iterates \(f^n\) are convex. In the class of these mappings we study three families of functions possessing convex iterative roots. A function f is said to be iteratively convex if f possesses convex iterative roots of all orders. A mapping f is said to be dyadically convex if for every \(n\ge 2\) there exists a convex iterative root \(f^{1/2^n}\) of order \(2^n\) and the sequence \(\{f^{1/2^n}\}\) satisfies the condition of compatibility, that is \( f^{1/2^n}\circ f^{1/2^n}= f^{1/2^{n-1}}.\) A function f is said to be flowly convex if it possesses a convex semi-flow of f, that is a family of convex functions \(\{f^t,t>0\}\) such that \(f^t\circ f^s=f^{t+s}, \ \ t,s >0\) and \(f^1=f\). We show the relations among these three types of convexity and we determine all convex iterative roots of non-monotonic functions.     

Vollständige und B-vollständige topologische Vektorgruppen Graphensätze und Open-Mapping Theorems

We are studying complete and B-complete topological vector groups. These Objects have been introduced by P. Kenderov [6] and D. A. Raikov [11]. They form a category TVG intermediate to the categories of topological Abelian groups and topological vector spaces and are close enough to the last one to give many useful applications to it. We first consider the problem of completion in the most used subcategories of TVG. A special functor allows to play back permanence property questions of completeness in locally convex vector groups to the same questions for locally convex vector spaces. Some examples of complete locally convex vector groups follow. We then unify some differently defined notions of B-completeness and generalize well known theorems concerning B-complete locally convex topological vector spaces to locally convex topological vector groups. Barrelledness concepts introduced in 9 and a special functor constructed in section 6 are used to formulate analogues of the closed graph and open mapping theorem for locally convex vector groups. The remainder of the note is left for applications to locally convex vector spaces. Many theorems about 1^p-sums of normed spaces are proved, as well as the B-completeness of a vast class of locally convex vector spaces including the spaces and of Köthe ([7], §13, No 5,6).     

Erdős–Szekeres-Type Theorems for Segments and Noncrossing Convex Sets

A family of convex sets is said to be in convex position, if none of its members is contained in the convex hull of the others. It is proved that there is a function N(n) with the following property. If is a family of at least N(n) plane convex sets with nonempty interiors, such that any two members of have at most two boundary points in common and any three are in convex position, then has n members in convex position. This result generalizes a theorem of T. Bisztriczky and G. Fejes Tóth. The statement does not remain true, if two members of may share four boundary points. This follows from the fact that there exist infinitely many straight-line segments such that any three are in convex position, but no four are. However, there is a function M(n) such that every family of at least M(n) segments, any four of which are in convex position, has n members in convex position.     

A Note on Shiffman's Theorems

Shiffman proved his famous first theorem, that if A R³ is a compact minimal annulus bounded by two convex Jordan curves in parallel (say horizontal) planes, then A is foliated by strictly convex horizontal Jordan curves. In this article we use Perron's method to construct minimal annuli which have a planar end and are bounded by two convex Jordan curves in horizontal planes, but the horizontal level sets of the surfaces are not all convex Jordan curves or straight lines. These surfaces show that unlike his second and third theorems, Shiffman's first theorem is not generalizable without further qualification.     

Novel Delay-Dependent Stabilization Criterion for Lur’e Systems with Sector-Restricted Nonlinearities and External Disturbances via PD Feedback Approach

In this paper, the effects of time delay on control of Lur’e systems are considered. Using a convex representation of the nonlinearity, a novel delay-dependent stability criterion is derived for the Lur’e systems via proportional-derivative (PD) feedback law. The Lyapunov–Krasovskii functional based on the delay discretization approach is used for the purpose of obtaining the stability condition by utilizing Projection Lemma. The criterion is utilized to not only guarantee stability of systems but also reduce the effect of external disturbance to an norm constraint. Finally, two numerical examples show the effectiveness of the proposed method.     

Convex Separable Minimization Subject to Bounded Variables

A minimization problem with convex and separable objective function subject to a separable convex inequality constraint and bounded variables is considered. A necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. Convex minimization problems subject to linear equality/linear inequality constraint, and bounds on the variables are also considered. A necessary and sufficient condition and a sufficient condition, respectively, are proved for a feasible solution to be an optimal solution to these two problems. Algorithms of polynomial complexity for solving the three problems are suggested and their convergence is proved. Some important forms of convex functions and computational results are given in the Appendix.     

Finding all solutions of nonlinearly constrained systems of equations

A new approach is proposed for finding all-feasible solutions for certain classes of nonlinearly constrained systems of equations. By introducing slack variables, the initial problem is transformed into a global optimization problem (P) whose multiple global minimum solutions with a zero objective value (if any) correspond to all solutions of the initial constrained system of equalities. All-globally optimal points of (P) are then localized within a set of arbitrarily small disjoint rectangles. This is based on a branch and bound type global optimization algorithm which attains finite-convergence to each of the multiple global minima of (P) through the successive refinement of a convex relaxation of the feasible region and the subsequent solution of a series of nonlinear convex optimization problems. Based on the form of the participating functions, a number of techniques for constructing this convex relaxation are proposed. By taking advantage of the properties of products of univariate functions, customized convex lower bounding functions are introduced for a large number of expressions that are or can be transformed into products of univariate functions. Alternative convex relaxation procedures involve either the difference of two convex functions employed in BB [23] or the exponential variable transformation based underestimators employed for generalized geometric programming problems [24]. The proposed approach is illustrated with several test problems. For some of these problems additional solutions are identified that existing methods failed to locate.     

Convexity in cristallographical lattices

A subset of a (cristallographical) lattice ⁿ is called convex whenever it is the intersection of the lattice with a convex set of the affine space containing ⁿ. We give a characterization of the convex sets which is intrinsic to the lattice and do the same for other related notions, e.g. the boundary of a convex set of ⁿ. A statement analogous to Helly's theorem is also proved.     

The GHS inequality and the Riemann hypothesis

LetV(t) be the even function on (–, ) which is related to the Riemann xi-function by (x/2)=4 _– exp(ixt–V(t))dt. In a proof of certain moment inequalities which are necessary for the validity of the Riemann Hypothesis, it was previously shown thatV'(t)/t is increasing on (0, ). We prove a stronger property which is related to the GHS inequality of statistical mechanics, namely thatV' is convex on [0, ). The possible relevance of the convexity ofV' to the Riemann Hypothesis is discussed.Communicated by Richard Varga.     

Über die Approximation von lokal konvexen Mengen

While convex sets in Euclidean space can easily be approximated by convex sets with C -boundary, the C -approximation of convex sets in Riemannian manifolds is a non-trivial problem. Here we prove that C-approximation is possible for a compact, locally convex set C in a Riemannian manifold if (i) C has strictly convex boundary or if (ii) the sectional curvature is positive or negative on C.The proofs are based on a detailed analysis of the distance function from C, on results from [1] and on the Greene-Wu approximation process for convex functions ([5], [6]). Finally, using similar methods, a partial tubular neighborhood with geodesic fibres is constructed for the boundary of a locally convex set. This construction is essential for some results in [2].     

Strong CHIP, normality, and linear regularity of convex sets

We extend the property (N) introduced by Jameson for closed convex cones to the normal property for a finite collection of convex sets in a Hilbert space. Variations of the normal property, such as the weak normal property and the uniform normal property, are also introduced. A dual form of the normal property is derived. When applied to closed convex cones, the dual normal property is the property (G) introduced by Jameson. Normality of convex sets provides a new perspective on the relationship between the strong conical hull intersection property (strong CHIP) and various regularity properties. In particular, we prove that the weak normal property is a dual characterization of the strong CHIP, and the uniform normal property is a characterization of the linear regularity. Moreover, the linear regularity is equivalent to the fact that the normality constant for feasible direction cones of the convex sets at is bounded away from 0 uniformly over all points in the intersection of these convex sets.