Related papers: Analysis of a method to parameterize planar curves…

We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…

We construct Peano curves $\gamma : [0,\infty) \to \mathbb{R}^2$ whose "footprints" $\gamma([0,t])$, $t>0$, have $C^\infty$ boundaries and are tangent to a common continuous line field on the punctured plane $\mathbb{R}^2 \setminus…

Suppose a smooth planar curve $\gamma$ is $2\pi$-periodic in the $x$ direction and the length of one period is $\ell$. It is shown that if $\gamma$ self-intersects, then it has a segment of length $\ell- 2\pi$ on which it self-intersects…

Here we consider the possible bulk and shear moduli of planar polycrystals built from a single crystal in various orientations. Previous work gave a complete characterization for crystals with orthotropic symmetry. Specifically, bounds were…

We consider families of parameterizations of reduced curve singularities over a Noetherian base scheme and prove that the delta invariant is semicontinuous. In our setting, each curve singularity in the family is the image of a…

Suppose $G$ is a graph with degrees bounded by $d$, and one needs to remove more than $\epsilon n$ of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of $G$ is far from…

We study the existence of at least one conformal metric of prescribed Gaussian curvature on a closed surface $\Sigma$ admitting conical singularities of orders $\alpha_i$'s at points $p_i$'s. In particular, we are concerned with the case…

We consider the space of chord-arc curves on the plane passing through the infinity with their parametrization $\gamma$ on the real line, and embed this space into the product of the BMO Teichm\"uller spaces. The fundamental theorem we…

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…

We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

The identification of the interfacial molecules in fluid-fluid equilibrium is a long-standing problem in the area of simulation. We here propose a new point of view, making use of concepts taken from the field of computational geometry,…

In this article, we prove that for several one-dimensional holomorphic families of holomorphic maps, in the parameter plane, there exists a local piece of a curve that lands at a given parabolic parameter, in the spirit of well-known…

Let $k$ be a non-archimedean complete valued field and let X be a smooth Berkovich analytic $k$-curve. Let $F$ be a finite locally constant \'{e}tale sheaf on $k$ whose torsion is prime to the residue characteristic. We denote by $|X|$ the…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…

We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe-Thurston-Andreev circle…

We consider variational problems that model the bending behavior of curves that are constrained to belong to given hypersurfaces. Finite element discretizations of corresponding functionals are justified rigorously via Gamma-convergence.…