Description:
This paper continues the study of `good arrangements' of collections of sets in normed spaces near a point in their intersection. Our aim is to study general nonlinear transversality properties. We focus on dual space (subdifferential and normal cone) necessary characterizations of these properties. As an application, we provide dual necessary conditions for the nonlinear extensions of the new transversality properties of a set-valued mapping to a set in the range space due to Ioffe.
Description:
The research was supported by the Australian Research Council, project DP160100854. The second author benefited from the support of the FMJH Program PGMO and from the support of EDF.
Description:
In this note we prove a symmetric version of the Neumann lemma as well as a symmetric version of the Soderlind-Campanato lemma. We establish in this way two partial generalizations of the well-known Casazza-Christenses lemma. This work is related to the Birkhoff-James orthogonality and to the concept of near operators introduced by S. Campanato. (C) 2019 Published by Elsevier Inc.
Description:
In this note we prove a symmetric version of the Neumann lemma as well as a symmetric version of the Soderlind-Campanato lemma. We establish in this way two partial generalizations of the well-known Casazza-Christenses lemma. This work is related to the Birkhoff-James orthogonality and to the concept of near operators introduced by S. Campanato. (C) 2019 Published by Elsevier Inc.
Description:
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that d-polytopes with at most d- 2 nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and d- 2 , showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for d-polytopes with d+ k vertices and at most d- k+ 3 nonsimple vertices, provided k
Description:
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that d-polytopes with at most d- 2 nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and d- 2 , showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for d-polytopes with d+ k vertices and at most d- k+ 3 nonsimple vertices, provided k
Description:
Funding details: Fondo Nacional de Desarrollo CientÃfico, Tecnológico y de Innovación Tecnológica, FONDECYT, PIA AFB-170001, 1190110, 1190012 Funding details: Universidad de Alicante, BEA- GAL 18/00205, PGC2018-097960-B-C21 Funding details: Australian Research Council, ARC, DP 180100602 Funding details: Comisión Nacional de Investigación CientÃfica y Tecnológica, CONICYT Funding details: Ministerio de Ciencia e Innovación, MICINN Funding text 1: Research supported by CONICYT (Fondecyt 1190012 and 1190110), Proyecto/Grant PIA AFB-170001, MICIU of Spain and Universidad de Alicante (Grant Beatriz Galindo BEA- GAL 18/00205), and Research Project PGC2018-097960-B-C21 from MICINN, Spain. The research of the third author is also supported by the Australian ARC - Discovery Projects DP 180100602
Description:
Funding details: Fondo Nacional de Desarrollo CientÃfico, Tecnológico y de Innovación Tecnológica, FONDECYT, PIA AFB-170001, 1190110, 1190012 Funding details: Universidad de Alicante, BEA- GAL 18/00205, PGC2018-097960-B-C21 Funding details: Australian Research Council, ARC, DP 180100602 Funding details: Comisión Nacional de Investigación CientÃfica y Tecnológica, CONICYT Funding details: Ministerio de Ciencia e Innovación, MICINN Funding text 1: Research supported by CONICYT (Fondecyt 1190012 and 1190110), Proyecto/Grant PIA AFB-170001, MICIU of Spain and Universidad de Alicante (Grant Beatriz Galindo BEA- GAL 18/00205), and Research Project PGC2018-097960-B-C21 from MICINN, Spain. The research of the third author is also supported by the Australian ARC - Discovery Projects DP 180100602
Description:
The paper concerns multiobjective linear optimization problems in
Description:
Funding details: European Commission, EC Funding details: European Regional Development Fund, FEDER Funding details: Australian Research Council, ARC Funding details: Australian Research Council, ARC, DP180100602 Funding details: Australian Research Council, ARC, DP-190100555 Funding details: Air Force Office of Scientific Research, AFOSR, 15RT04 Funding details: DMS-1512846, DMS-1808978 Funding text 1: This research has been partially supported by grants MTM2014-59179-C2-(1,2)-P and PGC2018-097960-B-C2(1,2) from MINECO/MICINN, Spain, and ERDF, “A way to make Europe”, European Union. Funding text 2: Research of the second author is also partially supported by the Australian Research Council (ARC) Discovery Grants Scheme (Project Grant # DP180100602). Funding text 3: Research of third author was partially supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, by the USA Air Force Office of Scientific Research grant #15RT04, and by Australian Research Council under grant DP-190100555.
Description:
The paper concerns multiobjective linear optimization problems in
Description:
Funding details: European Commission, EC Funding details: European Regional Development Fund, FEDER Funding details: Australian Research Council, ARC Funding details: Australian Research Council, ARC, DP180100602 Funding details: Australian Research Council, ARC, DP-190100555 Funding details: Air Force Office of Scientific Research, AFOSR, 15RT04 Funding details: DMS-1512846, DMS-1808978 Funding text 1: This research has been partially supported by grants MTM2014-59179-C2-(1,2)-P and PGC2018-097960-B-C2(1,2) from MINECO/MICINN, Spain, and ERDF, “A way to make Europe”, European Union. Funding text 2: Research of the second author is also partially supported by the Australian Research Council (ARC) Discovery Grants Scheme (Project Grant # DP180100602). Funding text 3: Research of third author was partially supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, by the USA Air Force Office of Scientific Research grant #15RT04, and by Australian Research Council under grant DP-190100555.
Description:
This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (SEV-2015-0563), the Spanish Ministry of Science (PID2019-111100RB-C21, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602).
Description:
This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (SEV-2015-0563), the Spanish Ministry of Science (PID2019-111100RB-C21, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602).
Description:
The Banach-Mazur separable quotient problem asks whether every infinite-dimensional Banach space B has a quotient space that is an infinite-dimensional separable Banach space. The question has remained open for over 80 years, although an affirmative answer is known in special cases such as when B is reflexive or even a dual of a Banach space. Very recently, it has been shown to be true for dual-like spaces. An analogous problem for topological groups is: Does every infinite-dimensional (in the topological sense) connected (Hausdorff) topological group G have a quotient topological group that is infinite dimensional and metrisable? While this is known to be true if G is the underlying topological group of an infinite-dimensional Banach space, it is shown here to be false even if G is the underlying topological group of an infinite-dimensional locally convex space. Indeed, it is shown that the free topological vector space on any countably infinite k(omega)-space is an infinite-dimensional toplogical vector space which does not have any quotient topological group that is infinite dimensional and metrisable. By contrast, the Graev free abelian topological group and the Graev free topological group on any infinite connected Tychonoff space, both of which are connected topological groups, are shown here to have the tubby torus T-omega, which is an infinite-dimensional metrisable group, as a quotient group.
Description:
The Separable Quotient Problem of Banach and Mazur asks if every infinite-dimensional Banach space has an infinite-dimensional separable quotient Banach space. It has remained unsolved for 85 years but has been answered in the affirmative for special cases such as reflexive Banach spaces. An affirmative answer to the Separable Quotient Problem would obviously imply that every infinite-dimensional Banach space has a quotient topological group which is separable, metrizable, and infinite-dimensional in the sense of topology. In this paper it is proved that every infinite-dimensional Banach space has as a quotient group the separable metrizable infinite-dimensional topological group, T
Description:
The Separable Quotient Problem of Banach and Mazur asks if every infinite-dimensional Banach space has an infinite-dimensional separable quotient Banach space. It has remained unsolved for 85 years but has been answered in the affirmative for special cases such as reflexive Banach spaces. An affirmative answer to the Separable Quotient Problem would obviously imply that every infinite-dimensional Banach space has a quotient topological group which is separable, metrizable, and infinite-dimensional in the sense of topology. In this paper it is proved that every infinite-dimensional Banach space has as a quotient group the separable metrizable infinite-dimensional topological group, T
Description:
The paper is devoted to the development of a comprehensive calculus for directional limiting normal cones, subdifferentials and coderivatives in finite dimensions. This calculus encompasses the whole range of the standard generalized differential calculus for (non-directional) limiting notions and relies on very weak (non-restrictive) qualification conditions having also a directional character. The derived rules facilitate the application of tools exploiting the directional limiting notions to difficult problems of variational analysis including, for instance, various stability and sensitivity issues. This is illustrated by some selected applications in the last part of the paper.
Description:
The paper is devoted to the development of a comprehensive calculus for directional limiting normal cones, subdifferentials and coderivatives in finite dimensions. This calculus encompasses the whole range of the standard generalized differential calculus for (non-directional) limiting notions and relies on very weak (non-restrictive) qualification conditions having also a directional character. The derived rules facilitate the application of tools exploiting the directional limiting notions to difficult problems of variational analysis including, for instance, various stability and sensitivity issues. This is illustrated by some selected applications in the last part of the paper.
Description:
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any d >= 3, the graph of a cubical d-polytope with minimum degree 5 is min{delta, 2d - 2}-connected. Second, we show, for any d >= 4, that every minimum separator of cardinality at most 2d - 3 in such a graph consists of all the neighbours of some vertex and that removing the vertices of the separator from the graph leaves exactly two components, with one of them being the vertex itself. (C) 2019 Elsevier Inc. All rights reserved.
Description:
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any d >= 3, the graph of a cubical d-polytope with minimum degree 5 is min{delta, 2d - 2}-connected. Second, we show, for any d >= 4, that every minimum separator of cardinality at most 2d - 3 in such a graph consists of all the neighbours of some vertex and that removing the vertices of the separator from the graph leaves exactly two components, with one of them being the vertex itself. (C) 2019 Elsevier Inc. All rights reserved.
Description:
We consider the following question: for which metrizable separable spaces X does the free abelian topological group A (X ⊕ X) isomorphically embed into A (X). While for many natural spaces X such an embedding exists, our main result shows that if X is a Cook continuum or X is a rigid Bernstein set, then A(X ⊕ X) does not embed into A(X) as a topological subgroup. The analogous statement is true for the free boolean group B (X).
Description:
We consider the following question: for which metrizable separable spaces X does the free abelian topological group A (X
Description:
Using techniques of variational analysis, necessary and sufficient subdifferential conditions for Holder error bounds are investigated and some new estimates for the corresponding modulus are obtained. As an application, we consider the setting of convex semi-infinite optimization and give a characterization of the Holder calmness of the argmin mapping in terms of the level set mapping (with respect to the objective function) and a special supremum function. We also estimate the Holder calmness modulus of the argmin mapping in the framework of linear programming.
Description:
Using techniques of variational analysis, necessary and sufficient subdifferential conditions for Holder error bounds are investigated and some new estimates for the corresponding modulus are obtained. As an application, we consider the setting of convex semi-infinite optimization and give a characterization of the Holder calmness of the argmin mapping in terms of the level set mapping (with respect to the objective function) and a special supremum function. We also estimate the Holder calmness modulus of the argmin mapping in the framework of linear programming.
Description:
For a d-dimensional polytope with v vertices, d + 1 <= v <= 2d, we calculate precisely the minimum possible number of m-dimensional faces, when m = 1 or m >= 0.62d. This confirms a conjecture of Grunbaum, for these values of m. For v = 2d + 1, we solve the same problem when m = 1 or d - 2; the solution was already known for m = d - 1. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of m-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have dimension at most 23.
Description:
For a d-dimensional polytope with v vertices, d + 1 <= v <= 2d, we calculate precisely the minimum possible number of m-dimensional faces, when m = 1 or m >= 0.62d. This confirms a conjecture of Grunbaum, for these values of m. For v = 2d + 1, we solve the same problem when m = 1 or d - 2; the solution was already known for m = d - 1. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of m-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have dimension at most 23.
Description:
Continuing with the work on the subdifferential of the pointwise supremum of convex functions, started in part I of this paper [R. Correa, A. Hantoute, M. A. Lopez, Valadier-like formulas for the supremum function I, J. Convex Analysis 25 (2018) 1253-1278], we focus now on the compactly indexed case. We assume that the index set is compact and that the data functions are upper semicontinuous with respect to the index variable (actually, this assumption will only affect the set of epsilon-active indices at the reference point). As in the previous work, we do not require any continuity assumption with respect to the decision variable. The current compact setting gives rise to more explicit formulas, which only involve subdifferentials at the reference point of active data functions. Other formulas are derived under weak continuity assumptions. These formulas reduce to the characterization given by M. Valadier [Sous-differentiels d'une borne superieure et d'une somme continue de fonctions convexes, C. R. Acad. Sci. Paris Ser. A-B Math. 268 (1969) 39-42, Theorem 2], when the supremum function is continuous.