Related papers: Curve Shortening and the Rendezvous Problem for Mo…

We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $…

In this article, we study compactifications of homogeneous spaces coming from equivariant, open embeddings into a generalized flag manifold $G/P$. The key to this approach is that in each case $G/P$ is the homogeneous model for a parabolic…

We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…

A self consistent field theory that describes a part of a contour loop of a random Gaussian surface as a trajectory interacting with itself is constructed. The exponent \nu characterizing the end to end distance is obtained by a Flory…

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…

From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds. Though many min-max algorithms have been analyzed in the…

The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2.…

We construct ancient solutions to Curve Shortening in the plane whose total curvature is uniformly bounded by gluing together an arbitrary chain of given Grim Reapers along their common asymptotes.

We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of intrinsic parametric regression. As customary in the literature, we start from the energy minimization formulation of linear least-squares in…

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced variants such as normalized and ratio cuts have seen more…

In this paper, we study a family of curves on $S^2$ that defines a two-dimensional smooth projective plane. We use curve shortening flow to prove that any two-dimensional smooth projective plane can be smoothly deformed through a family of…

We investigate the deformation of symmetry on cotangent bundles from the Euclidean plane to two-dimensional constant-curvature surfaces and the continuation of local dynamics aspects in Hamiltonian systems. For a fixed curvature sign…

This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…

The subgradient method is a classical and foundational approach in non-smooth convex optimization; its simplicity, robustness, and role as a conceptual and algorithmic starting point have made it the backbone of many significant…

In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…

Recently Andrews and Bryan [3] discovered a comparison function which allows them to shorten the classical proof of the well-known fact that the curve shortening flow shrinks embedded closed curves in the plane to a round point. Using this…

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…

We study closed smooth convex plane curves $\Gamma$ enjoying the following property: a pair of points $x,y$ can traverse $\Gamma$ so that the distances between $x$ and $y$ along the curve and in the ambient plane do not change; such curves…

Motivated by various results on homogeneous geodesics of Riemannian spaces, we study homogeneous trajectories, i.e. trajectories which are orbits of a one-parameter symmetry group, of Lagrangian and Hamiltonian systems. We present criteria…