相关论文: Trees in renorming theory
Assume that $X$ is a Banach space of measurable functions for which Koml\'os' Theorem holds. We associate to any closed convex bounded subset $C$ of $X$ a coefficient $t(C)$ which attains its minimum value when $C$ is closed for the…
We consider neural networks with a single hidden layer and non-decreasing homogeneous activa-tion functions like the rectified linear units. By letting the number of hidden units grow unbounded and using classical non-Euclidean…
In this paper, a strong variant for multivalued mappings of the well-known property of openness at a linear rate is studied. Among other examples, a simply characterized class of closed convex processes between Banach spaces, which…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
In our previous paper we systematized several known equivalent definitions of Fr\'echet (G\^ ateaux) Differentiability Spaces and Asplund (weak Asplund) Spaces. As an application, we extended the classical Mazur's theorem, and also proved…
In this paper we show how some metric properties of the unit sphere of a normed space can help to approach a solution to Tingley's problem. In our main result we show that if an onto isometry between the spheres of strictly convex spaces is…
The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional)…
Megrelishvili defines \emph{light groups} of isomorphisms of a Banach space as the groups on which the Weak and Strong Operator Topologies coincide, and proves that every bounded group of isomorphisms of Banach spaces with the Point of…
Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf…
Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships. We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations…
We introduce a new concept of perturbation of closed linear subspaces and operators in Banach spaces called uniform lambda-adjustment which is weaker than perturbations by small gap, operator norm, q-norm, and K2-approximation. In arbitrary…
A subset of a convex body $B$ containing the origin in a Euclidean space is {\it parkable in $B$} if it can be translated inside $B$ in such a manner that the translate the origin. We provide characterizations of ellipsoids and of centrally…
We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned…
We introduce two notions called $k-$weakly uniform rotundity ($k-$WUR) and $k-$weakly locally uniform rotundity ($k-$WLUR) in real Banach spaces. These are natural generalizations of the well-known concepts $k-$UR and WUR. By introducing…
We prove that the spaces $\ell_p$, $1<p<\infty, p\ne 2$, and all infinite-dimensional subspaces of their quotient spaces do not admit equivalent almost transitive renormings. This is a step towards the solution of the Banach-Mazur rotation…
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities…
We prove that if X is a complete geodesic metric space with uniformly generated first homology group and $f: X\to R$ is metrically proper on the connected components and bornologous, then X is quasi-isometric to a tree. Using this and…
This paper addresses the problem of wellposedness of non-autonomous linear evolution equations $\dot x = A(t)x$ in uniformly convex Banach spaces. We assume that $A(t):D \subset X\to X$, for each $t$ is the generator of a quasi-contractive…
In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a…
We show that there exists a family of instances of the lot-sizing problem, such that any branch-and-bound tree that solves them requires an exponential number of nodes, even in the case when the branchings are performed on general split…