English
Related papers

Related papers: DNA Origami and Unknotted A-trails in Torus Graphs

200 papers

In this paper we discuss off-shell representations of N-extended supersymmetry in one dimension, ie, N-extended supersymmetric quantum mechanics, and following earlier work on the subject codify them in terms of certain graphs, called…

Mathematical Physics · Physics 2012-08-27 C. F. Doran , M. G. Faux , S. J. Gates, , T. Hubsch , K. M. Iga , G. D. Landweber

We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…

Geometric Topology · Mathematics 2025-06-06 José Ayala

Each closed oriented 3-manifold $M$ is naturally associated with a set of integers $D(M)$, the degrees of all self-maps on $M$. $D(M)$ is determined for each torus bundle and torus semi-bundle $M$. The structure of torus semi-bundle is…

Geometric Topology · Mathematics 2008-10-13 Hongbin Sun , Shicheng Wang , Jianchun Wu

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

Recently, there has been a growing interest in the relationships between unrooted and rooted phylogenetic networks. In this context, a natural question to ask is if an unrooted phylogenetic network U can be oriented as a rooted phylogenetic…

Populations and Evolution · Quantitative Biology 2024-01-17 Janosch Döcker , Simone Linz

In this paper we will associate a family $\{K_1,\dots,K_l\}\subset \mathbb{S}^3$ of iterated torus knots to a given free numerical semigroup. We will describe the fundamental group of the knot complement of each knot of the family. Finally,…

Geometric Topology · Mathematics 2025-10-07 Patricio Almirón , Adrián Olivares-Fernández

We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…

Combinatorics · Mathematics 2019-03-01 Mariusz Kwiatkowski , Mark Pankov , Adam Tyc

We present a family of index 1 abelian current graphs whose derived embeddings can be modified into triangulations of $K_{12s}$ for $s \geq 4$. Our construction is significantly simpler than previous methods for finding genus embeddings of…

Combinatorics · Mathematics 2018-05-11 Timothy Sun

The celebrated K\H{o}v\'ari-S\'os-Tur\'an theorem states that any $n$-vertex graph containing no copy of the complete bipartite graph $K_{s,s}$ has at most $O_s(n^{2-1/s})$ edges. In the past two decades, motivated by the applications in…

Combinatorics · Mathematics 2025-04-30 Zach Hunter , Aleksa Milojević , Benny Sudakov , István Tomon

In this paper we introduce a representation of a embedded knotted (sometimes Lagrangian) tori in $\BR^4$ called a hypercube diagram, i.e., a 4-dimensional cube diagram. We prove the existence of hypercube homology that is invariant under…

Geometric Topology · Mathematics 2010-10-20 Scott Baldridge

Motivated by the construction of Newton--Okounkov bodies and toric degenerations via cluster algebras in [GHKK18, FO25], we consider a family of Newton--Okounkov polytopes of a complex smooth Fano variety $X$ related by a composition of…

Symplectic Geometry · Mathematics 2025-08-07 Yunhyung Cho , Myungho Kim , Yoosik Kim , Euiyong Park

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi

We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously…

Combinatorics · Mathematics 2015-01-27 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those that are obtained from a regular triangulation of the $r \times s$ toroidal grid where the vertices in the first and last column are…

Combinatorics · Mathematics 2022-10-11 Brahadeesh Sankarnarayanan

In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…

Data Structures and Algorithms · Computer Science 2025-08-20 Mithra Karamchedu , Lucas Bang

We investigate wrinkling patterns in a tri-layer torus consisting of an expanding thin outer layer, an intermediate soft layer and an inner core with a tunable shear modulus, inspired by pattern formation in developmental biologies, such as…

Soft Condensed Matter · Physics 2020-02-25 Xiaoxiao Zhang , Patrick T. Mather , Mark J. Bowick , Teng Zhang

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

Combinatorics · Mathematics 2026-05-21 Nathan Bowler , Florian Reich

The theory of Dvorak, Kral, and Thomas (2015) shows that a 4-critical triangle-free graph embedded in the torus has only a bounded number of faces of length greater than 4 and that the size of these faces is also bounded. We study the…

Combinatorics · Mathematics 2018-02-01 Zdeněk Dvořák , Jakub Pekárek

Electrical conductivity of DNA has been a controversial topic since it was first proposed in 1962. Disparities in the experimental results can often be explained by differences of the ambient or experimental conditions. We report the…

Soft Condensed Matter · Physics 2022-06-14 Florian Heimbach , Johann Bohlen , Hans Rabus , Woon Yong Baek , Philip Tinnefeld

An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that it is…

Combinatorics · Mathematics 2016-05-26 Jorgen Bang-Jensen , Stephane Bessy , Bill Jackson , Matthias Kriesell
‹ Prev 1 3 4 5 6 7 10 Next ›