Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 136 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 189 tok/s Pro
GPT OSS 120B 427 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Borromean Hypergraph Formation in Dense Random Rectangles (2405.20874v1)

Published 31 May 2024 in cond-mat.soft, cond-mat.stat-mech, and math.GN

Abstract: We develop a minimal system to study the stochastic formation of Borromean links within topologically entangled networks without requiring the use of knot invariants. Borromean linkages may form in entangled solutions of open polymer chains or in Olympic gel systems such as kinetoplast DNA, but it is challenging to investigate this due to the difficulty of computing three-body link invariants. Here, we investigate randomly oriented rectangles densely packed within a volume, and evaluate them for Hopf linking and Borromean link formation. We show that dense packings of rectangles can form Borromean triplets and larger clusters, and that in high enough density the combination of Hopf and Borromean linking can create a percolating hypergraph through the network. We present data for the percolation threshold of Borromean hypergraphs, and discuss implications for the existence of Borromean connectivity within kinetoplast DNA.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 31 likes.

Upgrade to Pro to view all of the tweets about this paper: