English
Related papers

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

200 papers

We show how to construct an ideal triangulation of a mapping torus of a pseudo-Anosov map punctured along the singular fibers. This gives rise to a new conjugacy invariant of mapping classes, and a new proof of a theorem of…

Geometric Topology · Mathematics 2010-08-24 Ian Agol

The recently proposed compressed backbone theory suggested that the intrinsic curvature in DNA can result from a geometric mismatch between the specific backbone length and optimal base stacking orientations. It predicted that the curvature…

Biomolecules · Quantitative Biology 2007-05-23 Dimitri E. Kamashev , Alexey K. Mazur

This work discusses string compactifications on the torus with optional Z_4 x Z_4 or Z_2 x Z_2 orbifold action from the perspective of matrix factorizations. The method is brought to a level where model building on these backgrounds is…

High Energy Physics - Theory · Physics 2010-04-22 Harun Omer

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

A proper vertex-colouring of a simple graph $G$ is said to be odd if, for every non-isolated vertex $v$ of $G$, some colour appears an odd number of times in the neighbourhood of $v$. We show that if $G$ embeds in the torus, then it admits…

Combinatorics · Mathematics 2022-05-10 Harry Metrebian

In the present paper, we study algorithmic questions for the arc-intersection graph of directed paths on a tree. Such graphs are known to be perfect (proved by Monma and Wei in 1986). We present faster algorithms than all previously known…

Discrete Mathematics · Computer Science 2009-02-10 Olivier Durand de Gévigney , Frédéric Meunier , Christian Popa , Julien Reygner , Ayrin Romero

The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of…

Combinatorics · Mathematics 2023-10-17 Paul Burkhardt , Vance Faber , David G. Harris

We study a special Teichmueller curve in the moduli space of curves of genus 3 that is intersected by infinitely many other Teichmueller curves. The Veech group of the underlying translation surface is SL_2(Z). All occurring Teichmueller…

Algebraic Geometry · Mathematics 2007-05-23 Frank Herrlich , Gabriela Schmithuesen

In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…

Populations and Evolution · Quantitative Biology 2025-12-05 Mirko Wilde , Mareike Fischer

Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-03 David Cifuentes-Núñez , Pedro Montealegre , Ivan Rapaport

RNA molecules are known to form complex secondary structures including pseudoknots. A systematic framework for the enumeration, classification and prediction of secondary structures is critical to determine the biological significance of…

Biomolecules · Quantitative Biology 2025-12-24 Rayan Ibrahim , Allison H. Moore

A self-avoiding plane-filling curve cannot be periodic, but we show that it can satisfy the local isomorphism property. We investigate three families of coverings of the plane by finite sets of nonoverlapping self-avoiding curves which…

Combinatorics · Mathematics 2023-10-31 Francis Oger

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently…

Combinatorics · Mathematics 2025-01-27 Ben Lund , Chuandong Xu

We introduce a novel neural network architecture for encoding and synthesis of 3D shapes, particularly their structures. Our key insight is that 3D shapes are effectively characterized by their hierarchical organization of parts, which…

Graphics · Computer Science 2017-05-16 Jun Li , Kai Xu , Siddhartha Chaudhuri , Ersin Yumer , Hao Zhang , Leonidas Guibas

Whitehead doubles provide a plethora of examples of knots that are topologically slice but not smoothly slice. We discuss the problem of the Whitehead double of the Figure 8 knot and survey commonly used techniques to obstructing sliceness.…

Geometric Topology · Mathematics 2024-10-29 Megan Fairchild

A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms…

Combinatorics · Mathematics 2025-06-09 Nino Bašić , Ivan Damnjanović

In this paper a random graph model $G_{\mathbb{Z}^2_N,p_d}$ is introduced, which is a combination of fixed torus grid edges in $(\mathbb{Z}/N \mathbb{Z})^2$ and some additional random ones. The random edges are called long, and the…

Combinatorics · Mathematics 2018-12-18 Svante Janson , Robert Kozma , Miklós Ruszinkó , Yury Sokolov

Quasars and Active Galactic Nuclei (AGNs) are often obscured by dust and gas. It is normally assumed that the obscuration occurs in an oblate "obscuring torus", that begins at the radius at which the most refractive dust can remain solid.…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-03 Martin Elvis

There are multiple mappings that can be used to generate what we call the 'edge geometry' of a regular N-gon, but they are all based on piecewise isometries acting on the extended edges of N to form a 'singularity' set W. This singularity…

Dynamical Systems · Mathematics 2024-07-09 Gordon Hughes

Various structural properties are developed for non-orientable surfaces in link spaces. The M\"obius band tree is described to represent genus growth of one-sided surfaces in solid tori. The structure of the Tree allows various insights…

Geometric Topology · Mathematics 2015-03-17 Loretta Bartolini
‹ Prev 1 8 9 10 Next ›