Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,738 papers · 148 categories

Trend · papers per month

2468 · Jul 201919922001200920172026
48 results for polymer entanglement

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

New methods assess topological entanglement in periodic systems.

problem Assessing topological entanglement in systems with periodic boundary conditions.
method Introducing Periodic Jones polynomial and Cell Jones polynomial.
result Periodic Jones polynomial is a recurring factor of Jones polynomial of finite cutoffs.

Study on entanglement complexity of confined ring polymers in lattice tubes.

problem Understanding the entanglement complexity of confined ring polymers in lattice tubes.
method Applied knot theory to extend and prove results about the complexity of 2SAPs.
result Proved that all but exponentially few size m 2SAPs have F complexity that grows at least linearly in m as m approaches infinity.

Develops a braid-theoretic framework to analyze chirality in molecular knots.

problem Analyzing chirality in molecular knots constructed using circuit topology.
method Translated circuit topology approach to knot engineering into braid-theoretic framework, calculating Jones polynomial for binary combinations.
result Jones polynomial provides a powerful tool for analyzing chirality of molecular knots.

Proposes a new model to predict polymer properties by integrating various data types.

problem Inaccurate polymer property prediction due to separate modeling of different data types.
method Multi-modal cascade feature transfer using GCN for chemical structure and molecular descriptors.
result Empirically evaluated model shows higher predictive performance than single-feature approaches.

Improved prediction of polymer morphology through machine learning and simulations.

problem Understanding and predicting the morphology of multi-component polymer blends.
method Modified Cahn-Hilliard model for simulations, machine learning for clustering and prediction.
result Machine learning achieved \geq 90% accuracy in predicting polymer morphology.

In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of KnK_n in a cube, the mean sum of squared linking numbers and the mean sum of square…

2015-08-05abs ↗pdf ↗

Bayesian modeling predicts hydroxide ion conductivity in polymer membranes.

problem Quantitative relationship between hydrophilic domain size and hydroxide ion conductivity in polymer membranes is unknown.
method Bayesian sparse modeling applied to copolymer composition data.
result Composition-derived features are identified as critical for predicting hydroxide ion conductivity.

Method optimizes knotting pathways in constrained polymers.

problem Understanding how geometric constraints affect knot formation in polymers.
method Topological steering using knotoid spectrum and mean unravelling number.
result Geometric constraints increase the frequency of twist knots in polymers.

Novel symmetry found in nanocarbons' discrete principal curvature structure.

problem Identifying novel symmetries in nanocarbons' geometric structures.
method First-principles calculations and discrete geometry analysis.
result Discovery of a novel symmetry (pre-constant discrete principal curvature) in nanocarbons.

HAL accelerates the generation of training sets for accurate interatomic potentials.

problem Generating accurate and transferable interatomic potentials is time-consuming and requires expert input.
method HAL framework using a physically motivated sampler with a biasing term to drive high uncertainty configurations.
result HAL-generated training databases for alloys and polymers predict macroscopic properties with high accuracy.

Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G. Alagic, M. Jarret, and S. Jordan it is shown that entanglement is a necessary condit…

2016-11-24abs ↗pdf ↗

The paper uncovers the mathematical structure enabling value decomposition in multi-agent systems.

problem Theoretical justification for why value decomposition works effectively in multi-agent systems remains underexplored.
method The paper introduces the concept of Markov entanglement to measure the underlying structure and demonstrates how it can be used to bound the decomposition error.
result The widely-used class of index policies is weakly entangled and enjoys a sublinear O(N)\mathcal O(\sqrt{N}) scale of decomposition error for NN-agent systems.

Enhances graph neural networks by creating virtual data examples.

problem Lack of examples to identify optimal graph rationales in graph applications.
method Introduces environment replacement to create virtual data examples and proposes a framework for rationale-environment separation and representation learning.
result Demonstrates the effectiveness and efficiency of the augmentation-based graph rationalization framework on molecular and polymer datasets.

Paper defines untangling number to measure entanglement complexity in 3-periodic networks.

problem Measuring the complexity of entanglement in 3-periodic networks.
method Defining ground states through knot-theoretic crossing diagrams and measuring untangling number.
result Introduced untangling number as a measure of entanglement complexity.

Any solution to the Yang-Baxter equation yields a family of representations of braid groups. Under certain conditions, identified by Turaev, the appropriately normalized trace of these representations yields a link invariant. Any Yang-Baxter solution can be interpreted as a two-qudit quantum gate. Here we show that if …

2015-07-21abs ↗pdf ↗

This work introduces 'Artificial Entanglement' to understand LLMs' fine-tuning effectiveness.

problem Understanding the effectiveness of parameter-efficient fine-tuning methods for large language models.
method Adopting a quantum-information-inspired perspective, the study measures 'Artificial Entanglement' in neural networks.
result LoRA and FFT induce distinct internal entanglement signatures but not external ones, suggesting a 'no-hair' property.

We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface ΣΣ that separates two subsystems of quantum strongly coupled N=4{\mathcal{N}}=4 SU(N) superconformal gauge theory. We extend this result and calculate en…

2008-02-21abs ↗pdf ↗

A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was observed recently, there exists a non-trivial integrated anomaly if an odd-dimensio…

2016-01-24abs ↗pdf ↗

We analyze the Ricci flow of a noncompact metric that describes a two-dimensional black hole. We consider entanglement entropy of a 2d black hole which is due to the quantum correlations between two subsystems: one is inside and the other is outside the black hole horizon. It is demonstrated that the entanglement entro…

2006-09-06abs ↗pdf ↗

Paper introduces untangling number to quantify 3-periodic tangle complexity.

problem Quantifying the complexity of 3-periodic tangles in biological, chemical, and physical systems.
method Introduces untangling number, a measure of minimum distance to ground state through diagrammatic operations.
result For infinite open curves, generic ground states are crystallographic rod packings.

We propose a conceptual design for a quantum blockchain. Our method involves encoding the blockchain into a temporal GHZ (Greenberger-Horne-Zeilinger) state of photons that do not simultaneously coexist. It is shown that the entanglement in time, as opposed to an entanglement in space, provides the crucial quantum adva…

2018-04-16abs ↗pdf ↗

New machine learning method detects quantum separability in large-scale systems.

problem Deciding quantum separability of large-scale bipartite density matrices.
method Frank-Wolfe-based algorithm for finding nearest separable density matrices and classification of density matrices as separable or entangled.
result The method scales up to thousands of density matrices and achieves high quantum entanglement detection accuracy.

A recent proposal by Ryu and Takayanagi for a holographic interpretation of entanglement entropy in conformal field theories dual to supergravity on anti-de Sitter (adS) is generalized to include entanglement entropy of black holes living on the boundary of adS. The generalized proposal is verified in boundary dimensio…

2006-06-21abs ↗pdf ↗

Study tackles causal effects of close contact on MRSA infections from entangled treatment data.

problem Estimating causal effects of close contact on MRSA infections from observational data with entangled treatments.
method NEAT method that models treatment assignment mechanism and mitigates confounding biases.
result NEAT method effectively estimates causal effects from entangled treatment data.

We present the quantum model of Bertrand duopoly and study the entanglement behavior on the profit functions of the firms. Using the concept of optimal response of each firm to the price of the opponent, we found only one Nash equilibirum point for maximally entangled initial state. The very presence of quantum entangl…

2010-01-16abs ↗pdf ↗

New metric for disentangling multivariate representations, accounting for more complex entanglements.

problem Current disentanglement metrics fail to detect entanglements involving more than two variables.
method Partial Information Decomposition framework to analyze information sharing and propose a new disentanglement metric.
result The proposed metric correctly identifies entanglements in high-dimensional spaces.

For a very ample line bundle L on a compact connected complex manifold X, with a real structure, we discuss entanglement properties of certain sequences of vectors in tensor products of spaces of holomorphic sections of powers of L.

2018-06-26abs ↗pdf ↗

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …

2018-02-03abs ↗pdf ↗