Related papers: Convex envelopes on Trees
We introduce a notion of convexity with respect to a one-dimensional operator and with this notion find a one-parameter family of different convexities that interpolates between classical convexity and quasiconvexity. We show that, for this…
We introduce a definition of a quasiconvex function on an infinite directed regular tree that depends on what we understood by a segment on the tree. Our definition is based on thinking on segments as sub-trees with the root as the midpoint…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…
The Convex Envelope of a given function was recently characterized as the solution of a fully nonlinear Partial Differential Equation (PDE). In this article we study a modified problem: the Dirichlet problem for the underlying PDE. The main…
In this paper we approximate the convex envelope of a boundary datum inside a bounded domain in the Euclidean space. We work with a random graph that is obtained as random points with uniform distribution that are connected by proximity…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
In this paper we study the two membranes problem for operators given in terms of a mean value formula on a regular tree. We show existence of solutions under adequate conditions on the boundary data and the involved source terms. We also…
First, we obtain a new formula for Bremermann type upper envelopes, that arise frequently in convex analysis and pluripotential theory, in terms of the Legendre transform of the convex- or plurisubharmonic-envelope of the boundary data.…
In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular…
This is a sequel to [1] and [2], which study the second boundary problem for special Lagrangian curvature potential equation. As consequences, we obtain the existence and uniqueness of the smooth uniformly convex solution by the method of…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
This is a PhD thesis about generated Jacobian equations; our purpose is twofold. First, we provide an introduction to these equations, whilst, at the same time, collating some results scattered throughout the literature. The other goal is…
In this work, we study regularity properties for nonvariational singular elliptic equations ruled by the infinity Laplacian. We obtain optimal $C^{1,\alpha}$ regularity along the free boundary. We also show existence of solutions,…