Related papers: Quasiconvex functions on regular trees
In this paper we give a characterization of all order isomorphisms on some classes of convex functions. We deal with the class $Cvx(K)$ consisting of lower-semi-continuous convex functions defined on a convex set $K$, and its subclass…
We discuss the issue of branching in quasiregular mapping, and in particular the relation between branching and the problem of finding geometric parametrizations for topological manifolds. Other recent progress and open problems of a more…
Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…
We investigate functions with the property that for every interval, the slope at the midpoint of the interval is the same as the average slope. More generally, we find functions whose average slopes over intervals are given by the slope at…
The aim of this paper is to prove that every non-empty set of valuations centered at a two-dimensional regular domain has an infimum. We also generalize some results related to a non-metric tree.
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…
Compensated convex transforms have been introduced for extended real-valued functions defined over $\mathbb{R}^n$. In their application to image processing, interpolation, and shape interrogation, where one deals with functions defined over…
We present two characterizations of quasiconvexity for radially semicontinuous mappings defined on a convex subset of a real linear space. As an application we obtain an extension of the Sion's minimax theorem, as well as a new…
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
We show that there exists a $q$-convex function in a neighborhood of a compact set $K$ in a complex manifold $\mathcal{M}$ if and only if the $q$-nucleus of this compact set is empty. The latter can be characterized as the maximal…
We study the local profiles of trees. We show that, in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…
In this paper, we present a notion of quasiconvexity in the setting of finitely-generated groups with hyperbolically embedded subgroups. Our main result shows that this notion yields uniform quasiconvex constants in the setting of coned-off…
Solutions to network optimization problems have greatly benefited from developments in nonlinear analysis, and, in particular, from developments in convex optimization. A key concept that has made convex and nonconvex analysis an important…
We study the class of compact convex subsets of a topological vector space which admits a strictly convex and lower semicontinuous function. We prove that such a compact set is embeddable in a strictly convex dual Banach space endowed with…
Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity. They have applications in computer science, network science,…