Tightness and computing distances in the curve complex

被引：0

作者：

Kenneth J. Shackleton

机构：

[1] University of Tokyo IPMU,

来源：

Geometriae Dedicata | 2012年 / 160卷

关键词：

A-Teichmüller theory; Mapping class groups; Curve complex; Combinatorial geometry; Algorithms; 57M50; 05C12;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We address the lack of local-finiteness in Harvey’s curve complex by computational means, computing bounds on certain intersection numbers among curves lying on a natural family of geodesics. We give a finite time algorithm for constructing all of these geodesics between any two curves, and treat stable lengths.

引用

页码：243 / 259

页数：16

共 50 条

[1] Tightness and computing distances in the curve complex
Shackleton, Kenneth J.
GEOMETRIAE DEDICATA, 2012, 160 (01) : 243 - 259
[2] MICC: A tool for computing short distances in the curve complex
Glenn, Paul
Menasco, William W.
Morrell, Kayla
Morse, Matthew J.
JOURNAL OF SYMBOLIC COMPUTATION, 2017, 78 : 115 - 132
[3] Computing distances on Riemann surfaces
Stepanyants, Huck
Beardon, Alan
Paton, Jeremy
Krioukov, Dmitri
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2024, 57 (34)
[4] Computing Behavioral Distances, Compositionally
Bacci, Giorgio
Bacci, Giovanni
Larsen, Kim G.
Mardare, Radu
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 74 - 85
[5] THE TIGHTNESS OF CERTAIN ALMOST COMPLEX SUBMANIFOLDS
SANCHEZ, CU
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1990, 110 (03) : 807 - 811
[6] COMPUTING GEODESIC DISTANCES IN TREE SPACE
Owen, Megan
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (04) : 1506 - 1529
[7] COMPUTING MINIMAL DISTANCES ON POLYHEDRAL SURFACES
WOLFSON, E
SCHWARTZ, EL
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (09) : 1001 - 1005
[8] On computing distances and latencies in Link Streams
Simard, Frederic
PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019), 2019, : 394 - 397
[9] Computing similarity distances between rankings
, Farzad Farnoud
Milenkovic, Olgica
Puleo, Gregory J.
Su, Lili
DISCRETE APPLIED MATHEMATICS, 2017, 232 : 157 - 175
[10] Computing complexity distances between algorithms
Romaguera, S
Sánchez-Pérez, EA
Valero, O
KYBERNETIKA, 2003, 39 (05) : 569 - 582

← 1 2 3 4 5 →