This book provides an introduction to vector optimization with variable ordering structures, id est, to optimization problems with a vector-valued objective function where the elements in the objective space are compared based on a variable ordering structure: instead of a parti…
Vector optimization with infimum and supremum
The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power s…
Vector optimization with infimum and supremum
Vector optimization with infimum and supremum
The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power s…
Vector optimization with infimum and supremum
The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power s…
^Using linear algebra and algebraic geometry over a sufficiently large field, Joel Friedman proved that ∑g ∈ Gr(X∩gY) <= r(X)r(Y). He showed that this inequality implies the strengthened Hanna Neumann conjecture. We simplify Friedman's proof of the foregoing inequality by replac…
In this paper the author establishes some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. He then uses these ideas to prove the Hanna Neumann Conjecture of the 1950s; in fact, he proves a strengthened form …