SearcharxivSearch

arXiv subjects

Alessandra Pluda

Publications and source records attributed to Alessandra Pluda.

At least 19 recordsLinked to original sources

One thousand and one higher-order geometric flows of networks

We show short-time existence and uniqueness up to reparametrization for a large class of higher-order geometric flows of curves and networks obtained as $L^2$-gradient flow of higher-order functionals involving derivatives of the curvature. Additionally, we prove a long-time existence result via energy methods.

math.AP

Nonlinear potential theory and Ricci-pinched 3-manifolds

In this paper, we focus on Hamilton's pinching conjecture formulated in Hamilton's paper "Three-manifolds with positive Ricci curvature". Let $(M, g)$ be a complete, connected, noncompact Riemannian $3$-manifold satisfying the Ricci-pinching condition. Then, it is flat. Here, we give an alternative proof, based on nonlinear potential theory, under the extra hypothesis of superquadratic volume growth.

math.DG

Fine properties of nonlinear potentials and a unified perspective on monotonicity formulas

We rigorously show that a large family of monotone quantities along the weak inverse mean curvature flow is the limit case of the corresponding ones along the level sets of $p$-capacitary potentials. Such monotone quantities include Willmore and Minkowski-type functionals on Riemannian manifolds with nonnegative Ricci curvature. In $3$-dimensional manifolds with nonnegative scalar curvature, we also recover the monotonicity of the Hawking mass and its nonlinear potential theoretic counterparts. This unified view is built on a refined analysis of $p$-capacitary potentials. We prove that they strongly converge in $W^{1,q}_{\mathrm{loc}}$ as $p\to 1^+$ to the inverse mean curvature flow and their level sets are curvature varifolds. Finally, we also deduce a Gauss-Bonnet-type theorem for level sets of $p$-capacitary potentials.

math.DG

A Note on Ricci-pinched three-manifolds

Let $(M, g)$ be a complete, connected, non-compact Riemannian $3$-manifold. Suppose that $(M,g)$ satisfies the Ricci--pinching condition $\mathrm{Ric}\geq\varepsilon\mathrm{R} g$ for some $\varepsilon>0$, where $\mathrm{Ric}$ and $\mathrm{R}$ are the Ricci tensor and scalar curvature, respectively. In this short note, we give an alternative proof based on potential theory of the fact that if $(M,g)$ has Euclidean volume growth, then it is flat. Deruelle-Schulze-Simon and Huisken-K\"{o}rber have already shown this result and together with the contributions by Lott and Lee-Topping led to a proof of the so-called Hamilton's pinching conjecture.

math.DG

Type-0 singularities in the network flow -- Evolution of trees

The motion by curvature of networks is the generalization to finite union of curves of the curve shortening flow. This evolution has several peculiar features, mainly due to the presence of junctions where the curves meet. In this paper we show that whenever the length of one single curve vanishes and two triple junctions coalesce, then the curvature of the evolving networks remains bounded. This topological singularity is exclusive of the network flow and it can be referred as a Type-0 singularity, in contrast to the well known Type-I and Type-II ones of the usual mean curvature flow of smooth curves or hypersurfaces, characterized by the different rates of blow up of the curvature. As a consequence, we are able to give a complete description of the evolution of tree-like networks till the first singular time, under the assumption that all the tangents flows have unit multiplicity. If the lifespan of such solutions is finite, then the curvature of the network remains bounded and we can apply the results by Ilmanen-Neves-Schulze/Lira-Mazzeo-Pluda-Saez to restart the flow after the singularity.

math.DG

Minimizing properties of networks via global and local calibrations

In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles equal to $\tfrac23 \pi$; in particular such objects are just critical points of the length functional a priori. We show that a minimal network $\Gamma_*$: i) minimizes mass among currents with coefficients in a suitable group having the same boundary of $\Gamma_*$, ii) identifies the interfaces of a partition of a neighborhood of $\Gamma_*$ solving the minimal partition problem among partitions with same boundary traces. Consequences and sharpness of such results are discussed. The proofs reduce to rather simple and direct arguments based on the exhibition of (global or local) calibrations associated to the minimal network.

math.OC

On the uniqueness of nondegenerate blowups for the motion by curvature of networks

In this note we prove uniqueness of nondegenerate compact blowups for the motion by curvature of planar networks. The proof follows ideas introduced in "Lojasiewicz-Simon inequalities for minimal networks: stability and convergence" for the study of stability properties of critical points of the length functional and it is based on the application of a Lojasiewicz-Simon gradient inequality.

math.AP

{\L}ojasiewicz-Simon inequalities for minimal networks: stability and convergence

We investigate stability properties of the motion by curvature of planar networks. We prove Lojasiewicz-Simon gradient inequalities for the length functional of planar networks with triple junctions. In particular, such an inequality holds for networks with junctions forming angles equal to $\tfrac23\pi$ that are close in $H^2$-norm to minimal networks, i.e., networks whose edges also have vanishing curvature. The latter inequality bounds a concave power of the difference between length of a minimal network $\Gamma_*$ and length of a triple junctions network $\Gamma$ from above by the $L^2$-norm of the curvature of the edges of $\Gamma$. We apply this result to prove the stability of minimal networks in the sense that a motion by curvature starting from a network sufficiently close in $H^2$-norm to a minimal one exists for all times and smoothly converges. We further rigorously construct an example of a motion by curvature having uniformly bounded curvature that smoothly converges to a degenerate network in infinite time.

math.DG

Variational models for the interaction of surfactants with curvature -- existence and regularity of minimizers in the case of flexible curves

Existence and regularity of minimizers for a geometric variational problem is shown. The variational integral models an energy contribution of the interface between two immiscible fluids in the presence of surfactants and includes a Helfrich type contribution, a Frank type contribution and a coupling term between the orientation of the surfactants and the curvature of the interface. Analytical results are proven in a one--dimensional situation for curves.

math.AP

Short-time existence for the network flow

This paper contains a new proof of the short-time existence for the flow by curvature of a network of curves in the plane. Appearing initially in metallurgy and as a model for the evolution of grain boundaries, this flow was later treated by Brakke \cite{Br} using varifold methods. There is good reason to treat this problem by a direct PDE approach, but doing so requires one to deal with the singular nature of the PDE at the vertices of the network. This was handled in cases of increasing generality by Bronsard-Reitich \cite{BrRe}, Mantegazza-Novaga-Tortorelli \cite{MNT} and eventually, in the most general case of irregular networks by Ilmanen-Neves-Schulze \cite{INS}. Although the present paper proves a result similar to the one in \cite{INS}, the method here provides substantially more detailed information about how an irregular network `resolves' into a regular one. Either approach relies on the existence of self-similar expanding solutions found in \cite{MS}. As a precursor to and illustration of the main theorem, we also prove an unexpected regularity result for the mixed Cauchy-Dirichlet boundary problem for the linear heat equation on a manifold with boundary.

math.DG

A survey of the elastic flow of curves and networks

We collect and present in a unified way several results in recent years about the elastic flow of curves and networks, trying to draw the state of the art of the subject. In particular, we give a complete proof of global existence and smooth convergence to critical points of the solution of the elastic flow of closed curves in $\mathbb{R}^2$. In the last section of the paper we also discuss a list of open problems.

math.AP

Existence and Uniqueness of the Motion by Curvature of regular networks

We prove existence and uniqueness of the motion by curvatureof networks in $\mathbb{R}^n$ when the initial datum is of class $W^{2-\frac{2}{p}}_p$, with triple junction where the unit tangent vectors to the concurring curves form angles of $120$ degrees. Moreover we investigated the regularization effect due to the parabolic nature of the system. An application of this wellposedness result is a new proof of Theorem 3.18 in "Motion by Curvature of Planar Networks" by Mantegazza-Novaga-Tortorelli where the possible behaviors of the solutions at the maximal time of existence are described. Our study is motivated by an open question proposed in "Evolution of Networks with Multiple Junctions " by Mantegazza-Novaga-Pluda-Schulze: does there exist a unique solution of the motion by curvature of networks with initial datum a regular network of class $C^2$? We give a positive answer.

math.AP

The oriented mailing problem and its convex relaxation

In this note we introduce a new model for the mailing problem in branched transportation in order to allow the cost functional to take into account the orientation of the moving particles. This gives an effective answer to [Problem 15.9] of the book "Optimal transportation networks" by Bernot, Caselles, and Morel. Moreover we define a convex relaxation in terms of rectifiable currents with group coefficients. With such approach we provide the problem with a notion of calibration. Using similar techniques we define a convex relaxation and a corresponding notion of calibration for a variant of the Steiner tree problem in which a connectedness constraint is assigned only among a certain partition of a given set of finitely many points.

math.AP

Degenerate elastic networks

We minimize a linear combination of the Willmore and the length functional among networks in $\mathbb{R}^d$ belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the junctions. Since this class lacks compactness, we characterize the set of limits of sequences of networks bounded in energy, providing an explicit representation of the relaxed problem. This is expressed in terms of the new notion of degenerate elastic networks that, rather surprisingly, involves only the properties of the given class, without reference to the curvature. In the case of $d=2$ we also give an equivalent description of degenerate elastic networks by means of a combinatorial definition easy to validate by a finite algorithm. Moreover we provide examples, counterexamples, and additional results that motivate our study and show the sharpness of our characterization.

math.OC

Lectures on curvature flow of networks

We present a collection of results on the evolution by curvature of networks of planar curves. We discuss in particular the existence of a solution and the analysis of singularities.

math.DG

Calibrations for minimal networks in a covering space setting

In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the idea is to divide the set of competitors in a suitable way, defining an appropriate (and weaker) notion of calibration. Then, calibrating the candidate minimizers in each family and comparing their perimeter, it is possible to find the minimizers of the minimization problem. Thanks to this procedure we prove the minimality of the Steiner configurations spanning the vertices of a regular hexagon and of a regular pentagon.

math.OC

On different notions of calibrations for minimal partitions and minimal networks in $\mathbb{R}^2$

Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner Problem and for planar minimal partitions. The paper is then complemented with remarks on the convexification of the problem, on non-existence of calibrations and on calibrations in families.

math.OC