English
Related papers

Related papers: Short Ropes and Long Knots

200 papers

A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…

Metric Geometry · Mathematics 2016-05-26 Bill Jackson , J. C. Owen

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

Geometric Topology · Mathematics 2020-06-25 Maciej Mroczkowski

We classify nonnegatively curved simply connected 4-manifolds with circle symmetry up to equivariant diffeomorphisms. The main problem is rule out knotted curves in the singular set of the orbit space. As an extension of this work we…

Differential Geometry · Mathematics 2016-01-20 Karsten Grove , Burkhard Wilking

Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into $R^2$, such that no more than two points project to the same point in $R^2$. These diagrams are drawings of 4-regular plane multigraphs. Knots are…

Computational Geometry · Computer Science 2019-03-12 Philipp Kindermann , Stephen Kobourov , Maarten Löffler , Martin Nöllenburg , André Schulz , Birgit Vogtenhuber

A knot in $S^3$ is rationally slice if it bounds a disk in a rational homology ball. We give an infinite family of rationally slice knots that are linearly independent in the knot concordance group. In particular, our examples are all…

Geometric Topology · Mathematics 2023-02-01 Jennifer Hom , Sungkyung Kang , JungHwan Park , Matthew Stoffregen

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

Combinatorics · Mathematics 2014-07-11 C. Laflamme , M. Pouzet , R. Woodrow

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

Number Theory · Mathematics 2009-03-25 Stefan Gerhold

We give a locally minimal, but not globally minimal bridge position of a knot, that is, an unstabilized, nonminimal bridge position of a knot. It implies that a bridge position cannot always be simplified so that the bridge number…

Geometric Topology · Mathematics 2013-06-05 Makoto Ozawa , Kazuto Takao

Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…

Geometric Topology · Mathematics 2016-09-07 Victor A. Vassiliev

A \emph{loop} $(B,\cdot)$ is a set $B$ together with a binary operation $\cdot$ such that (i) for each $a\in B$, the left and right translation mappings $L_{a}:B\to B: x \mapsto a\cdot x$ and $R_{a}:B\to B: x \mapsto x\cdot a$ are…

Group Theory · Mathematics 2007-05-23 Oliver Jones , Michael K. Kinyon

This paper contains a construction of a finite set X in the boundary of the unit 3-ball in R^3 whose minimal tree is knotted. The example answers Problem 5.17 in ''Problems in Low-dimensional Topology'' by Rob Kirby posed by Michael…

Metric Geometry · Mathematics 2007-05-23 Krystyna Kuperberg

Generally, in any human field, a Smarandache Structure on a set A means a weak structure W on A such that there exists a proper subset B which is embedded with a stronger structure S. By proper subset one understands a set included in A,…

General Mathematics · Mathematics 2007-05-23 W. B. Vasantha Kandasamy

Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining $L\geq\alpha_0…

Geometric Topology · Mathematics 2026-03-16 Alexander R. Klotz

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly…

Geometric Topology · Mathematics 2007-05-23 Gengyu Zhang

We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…

Statistical Mechanics · Physics 2007-05-23 J. Hickford , R. Jones , S. Courrech du Pont , J. Eggers

We prove that simplicial volume and dilatation are monotone under ribbon concordance between fibered knots in $S^3$, and that every fibered knot has only finitely many predecessors in the ribbon-concordance partial order, providing evidence…

Geometric Topology · Mathematics 2026-03-12 Ian Agol , Qiuyu Ren

Let $\mathcal {M}$ be the space of all, including singular, long knots in 3-space and for which a fixed projection into the plane is an immersion. Let $cl(\Sigma^{(1)}_{iness})$ be the closure of the union of all singular knots in $\mathcal…

Geometric Topology · Mathematics 2009-03-10 Thomas Fiedler

A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…

Combinatorics · Mathematics 2026-05-19 Zakir Deniz , Hakan Guler , Anthony Nixon

In a linear chord diagram a short chord is one which joins adjacent vertices. We define a bubble to be a region in a linear chord diagram devoid of short chords. We derive a formal generating function counting bubbles by their size and find…

Combinatorics · Mathematics 2024-08-20 Donovan Young

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Combinatorics · Mathematics 2024-10-11 Adam D. W. Clay , Tibor Jordán , Sára Hanna Tóth
‹ Prev 1 4 5 6 7 8 10 Next ›