Related papers: Convex envelopes on Trees
The study of evolutes of plane curves goes back at least to Huygens, and was continued and extended to space curves by Monge, Darboux, and others. Salmon studied projective curves and surfaces and their evolutes and gave many enumerative…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
We consider rotational initial data for the two-dimensional incompressible Euler equations on an annulus. Using the convex integration framework, we show that there exist infinitely many admissible weak solutions (i.e. such with…
We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. We consider arbitrary linearly convergent inner solver including in particular stochastic…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
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…
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges.…
In this document, we present the main properties satisfied by the Moreau envelope of weakly convex functions. The Moreau envelope has been introduced in convex optimization to regularize convex functionals while preserving their global…
We introduce and study various algorithms for solving nonconvex minimization with inequality constraints, based on the construction of convex surrogate envelopes that majorize the objective and the constraints. In the case where the…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We present in this paper a result about existence and convexity of solutions to a free boundary problem of Bernoulli type, with non constant gradient boundary constraint depending on the outer unit normal. In particular we prove that, in…
We use convex decomposition theory to (1) reprove the existence of a universally tight contact structure on every irreducible 3-manifold with nonempty boundary, and (2) prove that every toroidal 3-manifold carries infinitely many…
We establish several results related to existence, nonexistence or bifurcation of positive solutions for a Dirichlet boundary value problem with in a smooth bounded domain. The main feature of this paper consists in the presence of a…
In this paper we provide some exact formulas for projective dimension and the regularity of powers of edge ideals of vertex-weighted rooted forests. These formulas are functions of the weight of the vertices and the number of edges. We also…
We consider the Dirichlet problem on infinite and locally finite rooted trees, and we prove that the set of irregular points for continuous data has zero capacity. We also give some uniqueness results for solutions in Sobolev $ W^{1,p} $ of…
It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is…
For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ \pi(G)=\frac{\operatorname{per}(L(G))}{\prod_{v\in V(G)} d(v)}, \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…