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,742 papers · 148 categories

Trend · papers per month

17355269 · Jun 202619922001200920172026
48 results for rigid diagrams

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

problem Classifying knots and links as rigid or shaky based on adaptability to Reidemeister moves.
method Categorization of hard diagrams as rigid or shaky, investigation of rigid and shaky hard diagrams for specific knots and links.
result Every link has a rigid hard diagram, and there is an upper limit for the number of crossings in such diagrams.

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for certain amalgamations of free groups: the direct limits of two such diagrams are iso…

2005-06-24abs ↗pdf ↗

New groups from strand diagrams show polycyclic subgroups are virtually abelian and undistorted.

problem Understanding the structure of mapping class groups.
method Introducing Chambord groups from braided strand diagrams and semigroup presentations.
result Polycyclic subgroups in Chambord groups are virtually abelian and undistorted.

Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes wit…

1998-06-22abs ↗pdf ↗

We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups, although diagram groups are as a rule non-Abelian. Part of the paper is a review of th…

2003-01-21abs ↗pdf ↗

We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation whose length is a cubic function of the number of 'riser marks'. For classical knots…

2012-08-01abs ↗pdf ↗

In this paper, we prove a version of the classical Cartan-Hadamard theorem for negatively curved manifolds, of dimension n5n\neq 5, with non-empty totally geodesic boundary. More precisely, if M1n,M2nM_1^n,M_2^n are any two such manifolds, we show that (1) M~1n\partial ^\infty \tilde M_1^n is homeomorphic to $\partial ^\infty…

2006-06-24abs ↗pdf ↗

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

problem Modeling RNA foldings considering both entanglement and intrachain interactions.
method Combines knot theory with embedded rigid vertex graphs to emphasize both entanglement and intrachain interactions of RNA foldings.
result Defines and computes a coloring counting invariant for stuck links, providing explicit computations for arc diagrams of RNA foldings.

Given a singular Schubert variety Z in a compact Hermitian symmetric space it is a longstanding question to determine when Z is homologous to a smooth variety Y. We identify those Schubert varieties for which there exist first-order obstructions to the existence of Y. This extends (independent) work of M. Walters, R. B…

2011-02-09abs ↗pdf ↗

The paper develops methods to bound causal effects using Partial Ancestral Graphs.

problem Bounding causal effects from observational data when true causal diagrams are unknown.
method Proposes a method using Partial Ancestral Graphs to derive bounds on causal effects from observational data.
result Demonstrates the effectiveness of the method with synthetic and real data examples.

Study topological properties of integrable case on Lie algebra so(4).

problem Topological analysis of integrable case for Euler's equations on so(4).
method Construction of bifurcation diagrams, determination of critical points, description of Liouville tori bifurcations, computation of loop molecules.
result Some topological properties of Kovalevskaya case can be derived from the case on so(4).

A detailed version of preprint "Self-linking number of a real algebraic link" by the same author, alg-geom/9410030. For a nonsingular real algebraic curve in 3-dimensional projective space or 3-sphere, a new integer-valued characteristic is introduced. It is invariant under rigid isotopy and multiplied by -1 under mirr…

2000-05-16abs ↗pdf ↗

A generalization of the Euler-Plateau problem to account for the energy contribution due to twisting of the bounding loop is proposed. Euler-Lagrange equations are derived in a parameterized setting and a bifurcation analysis is performed. A pair of dimensionless parameters govern bifurcations from a flat, circular gro…

2014-05-07abs ↗pdf ↗

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

2016-06-02abs ↗pdf ↗

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

2007-06-19abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

2017-12-25abs ↗pdf ↗

Problems on region choices for knot and link diagrams solved using Alexander numbering.

problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

2018-03-19abs ↗pdf ↗

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

2006-04-30abs ↗pdf ↗

The paper explores when specific knot operations simplify diagrams.

problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

New estimate of semimeander complexity for knots with more than 10 crossings.

problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.311.558cr(K)0.31 \cdot 1.558^{\operatorname{cr}(K)} crossings.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

2010-07-23abs ↗pdf ↗

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

Complete criterion for VoI in multi-decision influence diagrams established.

problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.

A virtual link diagram is called mod mm almost classical if it admits an Alexander numbering valued in integers modulo mm, and a virtual link is called mod mm almost classical if it has a mod mm almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod mm almost class…

2019-03-08abs ↗pdf ↗