Related papers: Plateau's Problem: What's Next
We discuss an analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring, in terms of an effective energy landscape. Several intriguing geometrical properties of the solution space become in this light…
We prove existence and a.e. regularity of an area minimizing soap film with a bound on energy spanning a given Jordan curve in R^3. The energy of a film is defined to be the sum of its surface area and the length of its singular branched…
We study a problem of minimal surfaces with free boundary written in the form of a non convex minimization problem. Our aim is to characterize optimal solutions by finding a suitable calibration field. A natural upper bound of the infimum…
The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…
The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…
We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of…
We compute an upper bound for the value of the $L^1$-relaxed area of the graph of the vortex map $u : B_l(0)\subset \mathbb R^2 \to \mathbb R^2$, $u(x):= x/\vert x\vert$, $x \neq 0$, for all values of $l>0$. Together with a previously…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
Matrix completion is a classical problem in data science wherein one attempts to reconstruct a low-rank matrix while only observing some subset of the entries. Previous authors have phrased this problem as a nuclear norm minimization…
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $\mathbb{Z}_{>0}^2$?…
A $(k,m)$-Furstenberg set $S \subset \mathbb{F}_q^n$ over a finite field is a set that has at least $m$ points in common with a $k$-flat in every direction. The question of determining the smallest size of such sets is a natural…
The basic (and traditional) crossing number problem is to determine the minimum number of crossings in a topological drawing of an input graph in the plane. We develop a unified framework yielding fixed-parameter tractable (FPT) algorithms…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
An ill-posed problem of synthesis of the Pierce electrodes for a cylindrical beam with a polygonal cross-section is considered. It is assumed that a beam of charged particles is extracted from a space-charge-limited planar diode and the…
In this paper, we study the asymptotic Plateau problem in hyperbolic space for constant sum Hessian curvature. More precisely, given a asymptotic boundary $\Gamma$, one seeks a complete hypersurface $\Sigma$ in $\mathbb{H}^{n+1}$ satisfying…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
In this paper, we will solve the Reifenberg Plateau Problem in Hilbert space.
This work is dedicated to the study of quasi-linear elliptic problems with $L^1$ data, the simple model will be the next equation on $ (M,g) $ a compact Riemannian manifold. $$-\Delta_{p} u=f$$ Where $f\in L^{1}(M) $ .Our goal is to develop…