English
Related papers

Related papers: On the factorization of composite polymer knots in…

200 papers

We discuss the scattering function of a Gaussian random polygon with N nodes under a given topological constraint through simulation. We obtain the Kratky plot of a Gaussian polygon of N=200 having a fixed knot for some different knots such…

Soft Condensed Matter · Physics 2009-11-11 Miyuki K. Shimamura , Kumiko Kamata , Akihisa Yao , Tetsuo Deguchi

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

Number Theory · Mathematics 2012-08-29 Wayne Lawton

We give an analytical approach to the definition of additive and multiplicative free convolutions which is based on the theory of Nevanlinna and of Schur functions. We consider the set of probability distributions as a semigroup $\bold M$…

Operator Algebras · Mathematics 2010-10-12 G. Chistyakov , F. Götze

Many knots and links in S^3 can be drawn as gluing of three manifolds with one or more four-punctured S^2 boundaries. We call these knot diagrams as double fat graphs whose invariants involve only the knowledge of the fusion and the…

High Energy Physics - Theory · Physics 2015-07-30 A. Mironov , A. Morozov , An. Morozov , P. Ramadevi , Vivek Kumar Singh

Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…

Machine Learning · Statistics 2018-05-02 Pouya Pezeshkpour , Carlos Guestrin , Sameer Singh

Topologically constrained genome-like polymers often double-fold into tree-like configurations. Here we calculate the exact number of tightly double-folded configurations available to a ring polymer in ideal conditions. For this purpose, we…

Soft Condensed Matter · Physics 2026-03-02 Pieter H. W. van der Hoek , Angelo Rosa , Elham Ghobadpour , Ralf Everaers

Hydrodynamic interactions as modeled by Multi-Particle Collision Dynamics can dramatically influence the dynamics of fully flexible, ring-shaped polymers in ways not known for any other polymer architecture or topology. We show that steady…

Soft Condensed Matter · Physics 2019-09-09 M. Liebetreu , C. N. Likos

Monte Carlo simulations are used to study the conformational behavior of a semiflexible polymer confined to cylindrical and conical channels. The channels are sufficiently narrow that the conditions for the Odijk regime are marginally…

Soft Condensed Matter · Physics 2020-12-02 James M. Polson , Cameron G. Hastie

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

Symbolic Computation · Computer Science 2015-02-27 Zijia Li , Josef Schicho , Hans-Peter Schröcker

It is nontrivial whether the average size of a ring polymer should become smaller or larger under a topological constraint. Making use of some knot invariants, we evaluate numerically the mean square radius of gyration for ring polymers…

Statistical Mechanics · Physics 2016-08-31 Miyuki K. Shimamura , Tetsuo Deguchi

A lattice polytope is "free" (or "empty") if its vertices are the only lattice points it contains. In the context of valuation theory, Klain (1999) proposed to study the functions $\alpha_i(P;n)$ that count the number of free polytopes in…

Combinatorics · Mathematics 2021-02-23 Sebastian Manecke , Raman Sanyal

We study reversible polymerization of rings. In this stochastic process, two monomers bond and as a consequence, two disjoint rings may merge into a compound ring, or, a single ring may split into two fragment rings. This…

Statistical Mechanics · Physics 2011-06-03 E. Ben-Naim , P. L. Krapivsky

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

Combinatorics · Mathematics 2007-05-23 John Irving

We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…

Representation Theory · Mathematics 2024-05-03 Véronique Bazier-Matte , Ralf Schiffler

We extend path analysis by showing that, for a singly-connected path diagram, the partial covariance of two random variables factorizes over the nodes and edges in the path between the variables. This result allows us to determine the…

Methodology · Statistics 2022-06-24 Jose M. Peña

Terao's factorization theorem shows that if an arrangement is free, then its characteristic polynomial factors into the product of linear polynomials over the integer ring. This is not a necessary condition, but there are not so many…

Combinatorics · Mathematics 2021-06-25 Takuro Abe

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…

Geometric Topology · Mathematics 2018-08-13 Moshe Cohen , Chaim Even-Zohar , Sunder Ram Krishnan

The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…

Geometric Topology · Mathematics 2018-04-27 Chaim Even-Zohar

We give statistical definitions of the length, l, of a loose prime knot tied into a long, fluctuating ring macromolecule. Monte Carlo results for the equilibrium, good solvent regime show that < l > ~ N^t, where N is the ring length and t ~…

Statistical Mechanics · Physics 2009-11-10 B. Marcone , E. Orlandini , A. L. Stella , F. Zonta

While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…

Computational Complexity · Computer Science 2024-12-02 Shreya Gupta , Boyang Huang , Russell Impagliazzo , Stanley Woo , Christopher Ye