Search arXivSearch

arXiv · 2511.06617

Concatenative nonmonotonicity and optimal links in HP protein folding models

Abstract

The hydrophobic-polar (HP) model represents proteins as binary strings embedded in lattices, with fold quality measured by an energy score. We prove that the optimal fold energy is not monotonic under concatenation for several standard lattices, including the 2D and 3D rectangular, hexagonal, and triangular lattices. In other words, concatenating two polymers can produce a fold with strictly worse optimal energy than one of the polymers alone. For closed chains, we show that under the levels-of-hydrophobicity model of Agarwala et al. (1997), proper links can arise as uniquely optimal folds, revealing an unexpected connection between HP models and knot/link theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bjørn Kjos-Hanssen. 2025-11-10. Concatenative nonmonotonicity and optimal links in HP protein folding models. https://arxiv.org/abs/2511.06617

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO