English
Related papers

Related papers: Isotopy classes of 3-periodic net embeddings

200 papers

For a genus-1 1-bridge knot in the 3-sphere, that is, a (1,1)-knot, a middle tunnel is a tunnel that is not an upper or lower tunnel for some (1,1)-position. Most torus knots have a middle tunnel, and non-torus-knot examples were obtained…

Geometric Topology · Mathematics 2011-10-18 Sangbum Cho , Darryl McCullough

We discuss the fundamental (relative) 3-classes of knots (or hyperbolic links), and provide diagrammatic descriptions of the push-forwards with respect to every link-group representation. The point is an observation of a bridge between the…

Geometric Topology · Mathematics 2017-08-17 Takefumi Nosaka

A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…

Computational Geometry · Computer Science 2007-08-08 Colm O Dunlaing

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

Computational Geometry · Computer Science 2008-07-15 David Eppstein

Let $\phi : S^1\times D^2\to S^1$ be the natural projection. An oriented knot $K\hookrightarrow V = S^1\times D^2$ is called an almost closed braid if the restriction of $\phi$ to K has exactly two (non-degenerate) critical points (and K is…

Geometric Topology · Mathematics 2007-05-23 Thomas Fiedler

We construct embedded minimal surfaces which are $n$-periodic in $\mathbb{R}^n$. They are new for codimension $n-2\ge 2$. We start with a Jordan curve of edges of the $n$-dimensional cube. It bounds a Plateau minimal disk which Schwarz…

Differential Geometry · Mathematics 2017-07-31 Karsten Grosse-Brauckmann , Susanne Kürsten

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…

Geometric Topology · Mathematics 2017-12-29 Thomas Fleming , Joel Foisy

We discuss an "extrinsic" property of knots in a 3-subspace of the 3-sphere $S^3$ to characterize how the subspace is embedded in $S^3$. Specifically, we show that every knot in a subspace of the 3-sphere is transient if and only if the…

Geometric Topology · Mathematics 2016-03-30 Yuya Koda , Makoto Ozawa

Given a grid diagram for a knot or link K in $S^3$, we construct a filtered spectrum whose homology is the knot Floer homology of K. We conjecture that the filtered homotopy type of the spectrum is an invariant of K. Our construction does…

Geometric Topology · Mathematics 2025-09-11 Ciprian Manolescu , Sucharit Sarkar

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at most three. We present a new algorithm…

Combinatorics · Mathematics 2017-09-14 Kris Coolsaet , Patrick W. Fowler , Jan Goedgebeur

If a graph $G$ can be embedded on the torus, and be embedded linklessly in $\mathbb{R}^3$, it's not known whether or not we can always find a linkless embedding of $G$ contained in the standard (unknotted) torus; We show that, for orders 9…

Geometric Topology · Mathematics 2024-11-20 Nathan Hall

Systematic enumeration of crystalline networks with some special topological characters is of considerable interest in both mathematics and crystallography. Based on the restriction of lattice in cubic and inequivalent nodes not exceeding…

Materials Science · Physics 2013-02-27 Chaoyu He , L. Z. Sun , C. X. Zhang , J. X. Zhong

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Combinatorics · Mathematics 2018-09-10 Hugo Parlier , Lionel Pournin

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

All knots are fused isotopic to the unknot via a process known as virtualization. We extend and adapt this process to show that, up to fused isotopy, classical links are classified by their linking numbers.

Geometric Topology · Mathematics 2007-05-23 Andrew Fish , Ebru Keyman

Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes. If these…

Social and Information Networks · Computer Science 2022-06-22 Arash Dehghan-Kooshkghazi , Bogumił Kamiński , Łukasz Kraiński , Paweł Prałat , François Théberge

In this work, a complete homotopic interpretation on the periodic table of topological insulators and superconductors has been derived by establishing the loop sequence of the corresponding classifying spaces. In our approach, each…

Mathematical Physics · Physics 2013-11-13 Chunbo Zhao

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

High Energy Physics - Theory · Physics 2023-04-27 Dan Xie

One-class classifiers offer valuable tools to assess the presence of outliers in data. In this paper, we propose a design methodology for one-class classifiers based on entropic spanning graphs. Our approach takes into account the…

Machine Learning · Computer Science 2016-09-13 Lorenzo Livi , Cesare Alippi