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

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…

Let $S$ be an oriented surface of type $(g, n)$. We are interested in geodesics in the curve complex $\mathcal C(S)$ of $S$. In general, two $0$-simplexes in $\mathcal C(S)$ have infinitely many geodesics connecting the two simplexes while…

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

We consider several natural sets of curves associated to a given Teichm\"uller disc, such as the systole set or cylinder set, and study their coarse geometry inside the curve graph. We prove that these sets are quasiconvex and agree up to…

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

We develop a Morse-Lusternik-Schnirelmann theory for the distance between two points of a smoothly embedded circle in a complete Riemannian manifold. This theory suggests very naturally a definition of width that generalises the classical…

Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable…

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

In this paper, we study the finiteness problem of torsion points on an elliptic curve whose coordinates satisfy some multiplicative dependence relations. In particular, we prove that on an elliptic curve defined over a number field there…

We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…

Let $f \colon X \to B$ be a complex elliptic surface and let $\DD \subset X$ be an integral divisor dominating $B$. It is well-known that the Parshin-Arakelov theorem implies the Mordell conjecture over complex function fields by a…

We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…

The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…

We provide several families of compact complex curves embedded in smooth complex surfaces such that no neighborhood of the curve can be embedded in an algebraic surface. Different constructions are proposed, by patching neighborhoods of…

Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…

We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…

A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…