Topological entanglement complexity of systems of polygons and walks in tubes
Bibliographic record
Abstract
In this thesis, motivated by modelling polymers, the topological entanglement complexity of systems of two self-avoiding polygons (2SAPs), stretched polygons and systems of self-avoiding walks (SSAWs) in a tubular sublattice of Z 3 are investigated.In particular, knotting and linking probabilities are used to measure a polygon's selfentanglement and its entanglement with other polygons respectively.For the case of 2SAPs, it is established that the homological linking probability goes to one at least as fast as 1 -O(n -1/2 ) and that the topological linking probability goes to one exponentially rapidly as n, the size of the 2SAP, goes to infinity.For the case of stretched polygons, used to model ring polymers under the influence of an external force f , it is shown that, no matter the strength or direction of the external force, the knotting probability goes to one exponentially as n, the size of the polygon, goes to infinity.Associating a two-component link to each stretched polygon, it is also proved that the topological linking probability goes to unity exponentially fast as n .Furthermore, a set of entangled chains confined to a tube is modelled by a system of self-and mutually avoiding walks (SSAW).It is shown that there exists a positive number such that the probability that an SSAW of size n has entanglement complexity (EC), as defined in this thesis, greater than n approaches one exponentially as n .It is also established that EC of an SSAW is bounded above by a linear function of its size.Using a transfer-matrix approach, the asymptotic form of the free energy for the SSAW model is also obtained and the average edge-density for span m SSAWs is proved to approach a constant as m .Hence, it is shown that EC is a "good" measure of entanglement complexity for dense polymer systems modelled by SSAWs, in particular, because EC increases linearly with system size, as the size of the system goes to infinity.First I would like to express my gratitude to my supervisor, Prof. Chris Soteros, for her support, patience and attempt to generously transmit the best of her knowledge to me.My special thanks goes to my
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".