Search arXivSearch

arXiv · 2504.12659

Topologically Directed Simulations Reveal the Impact of Geometric Constraints on Knotted Proteins

Abstract

Simulations of knotting and unknotting in polymers or other filaments rely on random processes to facilitate topological changes. Here we introduce a method of \textit{topological steering} to determine the optimal pathway by which a filament may knot or unknot while subject to a given set of physics. The method involves measuring the knotoid spectrum of a space curve projected onto many surfaces and computing the mean unravelling number of those projections. Several perturbations of a curve can be generated stochastically, e.g. using the Langevin equation or crankshaft moves, and a gradient can be followed that maximises or minimises the topological complexity. We apply this method to a polymer model based on a growing self-avoiding tangent-sphere chain, which can be made to model proteins by imposing a constraint that the bending and twisting angles between successive spheres must maintain the distribution found in naturally occurring protein structures. We show that without these protein-like geometric constraints, topologically optimised polymers typically form alternating torus knots and composites thereof, similar to the stochastic knots predicted for long DNA. However, when the geometric constraints are imposed on the system, the frequency of twist knots increases, similar to the observed abundance of twist knots in protein structures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Agnese Barbensi, Alexander R. Klotz, Dimos Gkountaroulis. 2025-04-17. Topologically Directed Simulations Reveal the Impact of Geometric Constraints on Knotted Proteins. https://arxiv.org/abs/2504.12659

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT