Related papers: Some remarks on convex analysis in topological gro…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…
We give some Korovkin-type theorems on convergence and estimates of rates of approximations of nets of functions, satisfying suitable axioms, whose particular cases are filter/ideal convergence, almost convergence and triangular…
In this paper, we introduce PM-mapping class monoids. Braid groups and mapping class groups have many features in common. Similarly to the notion of braid PM-monoid, PM-mapping class monoid is defined. This construction is an analogy of…
Some of the fundamental notions related to sets of lengths of Krull monoids with finite class group are discussed, and a survey of recent results is given. These include the elasticity and related notions, the set of distances, and the…
To provide a solid analytic foundation for the module approach to conditional risk measures, our purpose is to establish a complete random convex analysis over random locally convex modules by simultaneously considering the two kinds of…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
In this paper, one new classes of convex functions which is called MT-convex functions are given. We also establish some Hadamard-type inequalities.
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
The main results here are two Helly type theorems for the sum of (at most) unit vectors in a normed plane. Also, we give a new characterization of centrally symmetric convex sets in the plane.
Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…
Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others. This paper aims at a rather comprehensive survey of recent results on…
An introduction to geometric valuation theory is given. The focus is on classification results for $\operatorname{SL}(n)$ invariant and rigid motion invariant valuations on convex bodies and on convex functions.
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
We define an analytic index and prove a topological index theorem for a non-compact manifold $M\_0$ with poly-cylindrical ends. We prove that an elliptic operator $P$ on $M\_0$ has an invertible perturbation $P+R$ by a lower order operator…
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
This article employs techniques from convex analysis to present characterizations of (maximal) $n-$monotonicity, similar to the well-established characterizations of (maximal) monotonicity found in the existing literature. These…