Rotation Distance, Triangulations, and Hyperbolic Geometry

From MaRDI portal
Revision as of 14:15, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3799259

DOI10.2307/1990951zbMath0653.51017OpenAlexW4231033470WikidataQ56067257 ScholiaQ56067257MaRDI QIDQ3799259

No author found.

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/1990951






Related Items (only showing first 100 items - show all)

Simultaneous flips on triangulated surfacesTwo shortest path metrics on well-formed parentheses stringsA linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotationsThe asymptotic diameter of cyclohedraDissecting the circle, at randomThe Markovian hyperbolic triangulationThe pruning-grafting lattice of binary treesEfficient lower and upper bounds of the diagonal-flip distance between triangulationsThe geometry of graphs and some of its algorithmic applications\(k\)-restricted rotation distance between binary treesOn the rotation distance between binary treesFlip graphs of bounded degree triangulationsCombinatorial flip actions and Gelfand pairs for affine Weyl groupsA direct algorithm for restricted rotation distanceThe phagocyte lattice of Dyck wordsCompatibility fans for graphical nested complexesHigher secondary polytopes and regular plabic graphsUnnamed ItemFlip-graph moduli spaces of filling surfacesCatalan triangulations of the Möbius bandDistances in Domino Flip GraphsComputing the flip distance between triangulationsModular flip-graphs of one-holed surfacesLower bounds on the rotation distance of binary treesA near-quadratic algorithm for planning the motion of a polygon in a polygonal environmentRefined upper bounds for right-arm rotation distancesEdge contraction on dual ribbon graphs and 2D TQFTCOLORING CURVES ON SURFACESA proof of the orbit conjecture for flipping edge-labelled triangulationsFlip distance between triangulations of a simple polygon is NP-completeA type-B associahedron.A metric for rooted trees with unlabeled vertices based on nested parenthesesIterated fiber polytopesTopological recursion for symplectic volumes of moduli spaces of curvesGeneralizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary treesArc diagrams, flip distances, and Hamiltonian triangulationsThe dual diameter of triangulationsFlipping edge-labelled triangulationsSymmetries of unlabelled planar triangulationsFlip distance between two triangulations of a point set is NP-completeThe genus of curve, pants and flip graphsTwo-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedraUnnamed ItemTopological recursion for the Poincaré polynomial of the combinatorial moduli space of curvesBlockers for triangulations of a convex polygon and a geometric maker-breaker gameNONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRONMultitriangulations, pseudotriangulations and primitive sorting networksFlip distance between triangulations of a planar point set is APX-hardRandom recursive triangulations of the disk via fragmentation theoryA lower bound for the simplexity of the \(n\)-cube via hyperbolic volumesOn a subposet of the Tamari latticeThe diameter of associahedraThe higher Stasheff‐Tamari posetsA generalization of diagonal flips in a convex polygonEdge Conflicts do not Determine Geodesics in the AssociahedronThe diameter of type \(D\) associahedra and the non-leaving-face propertyFlipping in spiralsCounting equivalence classes of vertex pairs modulo the dihedral action on the associahedronFlips in planar graphsOn the deque conjecture for the splay algorithmHow I ‘met’ Dov TamariDiscriminative measures for comparison of phylogenetic trees\(W\)-associahedra have the non-leaving-face propertyThompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complexThe cost of offline binary search tree algorithms and the complexity of the request sequenceComputing spin networksTriangle-free triangulationsRotation sequences and edge-colouring of binary tree pairsThe rotation graph of \(k\)-ary trees is HamiltonianCut loci in lens manifoldsThe Fermat star of binary treesRotation distance is fixed-parameter tractableAssociahedra via spinesGenerating All Triangulations of Plane Graphs (Extended Abstract)Once punctured disks, non-convex polygons, and pointihedraTransforming plane triangulations by simultaneous diagonal flipsA point set whose space of triangulations is disconnectedThe permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equationA Glimpse into Thurston’s WorkMultitriangulations as complexes of star polygonsOn minimal triangulations of products of convex polygonsConstructions and complexity of secondary polytopesMinimum ideal triangulations of hyperbolic 3-manifoldsSigned diagonal flips and the four color theoremEnumeration of rooted planar triangulations with respect to diagonal flipsBounding restricted rotation distanceAn improved kernel size for rotation distance in binary treesNon-leaving-face property for marked surfacesUnnamed ItemGraphs of triangulations and perfect matchingsDiameter estimates for graph associahedraSpin network quantum simulatorRestricted rotation distance between binary trees.A Motzkin filter in the Tamari latticeAn algorithm to compute the möbius function of the rotation lattice of binary treesGeometry of the space of phylogenetic treesMotzkin subposets and Motzkin geodesics in Tamari lattices.Neighborhoods of trees in circular orderingsAn efficient upper bound of the rotation distance of binary treesKontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution




Cites Work




This page was built for publication: Rotation Distance, Triangulations, and Hyperbolic Geometry