相关论文: Tightness and computing distances in the curve com…

The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…

Notions of directional Chebyshev constant and transfinite diameter have recently been studied on certain algebraic curves in $\mathbb{C}^2$. The theory is extended here to curves in $\mathbb{C}^N$ for arbitrary $N$. The results are…

In this paper we explore relationships between divergence and thick groups, and with the same techniques we estimate lengths of shortest conjugators. We produce examples, for every positive integer n, of CAT(0) groups which are thick of…

While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

We prove a general counting result for arcs of the same type in compact surfaces. Wealso count infinite arcs in cusped surfaces and arcs in orbifolds. These theorems are derived from aresult that guarantees the convergence of certain…

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

Using the theory of minimal models of quasi-projective surfaces we give a new proof of the theorem of Lin-Zaidenberg which says that every topologically contractible algebraic curve in the complex affine plane has equation $X^n=Y^m$ in some…

We study the intersection of an algebraic variety with the maximal compact subgroup of a universal vectorial extension of a product of elliptic curves. For this intersection we show a Manin-Mumford type statement. This answers some…

The Riemannian manifold of curves with a Sobolev metric is an important and frequently studied model in the theory of shape spaces. Various numerical approaches have been proposed to compute geodesics, but so far elude a rigorous…

It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…

The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…

We revisit the well-known Curve Shortening Flow for immersed curves in the $d$-dimensional Euclidean space. We exploit a fundamental structure of the problem to derive a new global construction of a solution, that is, a construction that is…

This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…

Let C be a curve of genus at least 2 imbedded in a product of elliptic curves. We give an explicit upper bound for the points in the intersection of C with the union of all algebraic subgroups of a certain codimension. As a corollary we…

Computing the Fr\'echet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fr\'echet distance computations become easier. Let $P$ and $Q$ be two polygonal curves…

Let $X$ be the product of two projective spaces and consider the general CICY threefold $Y$ in $X$ with configuration matrix $A$. We prove the finiteness part of the analogue of the Clemens' conjecture for such a CICY in low bidegrees. More…

In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…

We establish the equality of classical and tropical curve counts for elliptic curves on toric surfaces with fixed $j$-invariant, refining results of Mikhalkin and Nishinou--Siebert. As an application, we determine a formula for such counts…

This note addresses computational difficulty of the Gromov-Wasserstein distance frequently mentioned in the literature. We provide details on the structure of the Gromov-Wasserstein distance optimization problem that show its non-convex…