Algorithm constructs and classifies weaving diagrams using combinatorial methods.
problem Classifying unique weaving diagrams with over/under information.
method Systematic algorithm based on tiling and crossing matrices.
result Classification of periodic structures based on minimum crossings.
Paper characterizes isotopies and hyperbolicity of weaves using geodesics.
problem Characterizing isotopies and hyperbolicity of weaves.
method Using diagrams of closed geodesics and normal positions of essential surfaces.
result Weaves are hyperbolic and cannot have essential Conway spheres.
Study on bounds of knot untangling for specific types of knots.
problem Determining upper limits for knot untangling.
method Defined warping degree, examined diagrams combinatorially.
result Upper bounds for unknotting and region unknotting numbers.
This paper classifies a specific weave type by their crossing number.
problem Classifying doubly periodic untwisted (p,q)-weaves.
method Classification by crossing number, introducing crossing matrix for equivalence.
result Classification of untwisted (p,q)-weaves by their crossing number.
This paper classifies periodic weaves and their universal cover, extending Tait's conjectures.
problem Classifying periodic weaves and their universal cover in thickened surfaces.
method Introducing hyperbolic periodic weaves, extending Tait's conjectures, and using a generalized Kauffman bracket polynomial.
result Tait's conjectures are extended to minimal reduced alternating weaving motifs.
Paper constructs motifs from planar tilings for DP weaves and polycatenanes.
problem Creating complex entangled structures from periodic tilings.
method Combinatorial methodology using polygonal link transformations.
result Predicting the type of motif from a given tiling and polygonal link method.
Weaving knots are alternating knots with the same projection as torus knots, and were conjectured by X.-S. Lin to be among the maximum volume knots for fixed crossing number. We provide the first asymptotically correct volume bounds for weaving knots, and we prove that the infinite weave is their geometric limit.
Study links weaving knots with polynomial coefficients and lattice numbers.
problem Understanding polynomial coefficients of weaving knots and their lattice counterparts.
method Established relationships between Jones and Chebyshev polynomials, and derived explicit formulas for Alexander polynomials.
result Proved coefficients of Jones polynomial are Whitney numbers of Lucas lattices and satisfied Fox's trapezoidal conjecture.
Formula found for knot determinant in 3-braid weaving.
problem Determining the determinant of a specific type of knot.
method Developed a formula for the determinant of the twisted generalized hybrid weaving knot.
result Proved a conjecture about the knot's determinant.
The paper calculates properties of weaving knots and their unknotting numbers.
problem Calculating properties of specific weaving knots.
method Deriving formulae for knot determinants and homology groups.
result Lower bounds on unknotting numbers for certain weaving knots.
Weaved helices form mechanically stable 3D structures.
problem Creating stable 3D structures from helical elements.
method Exploiting screw symmetry and invariant cylindrical rod packing to form triply periodic arrangements.
result Demonstrated nineteen triply periodic arrangements of interwoven helices.
We prove the existence of Lagrangian fillings for Dn-type Legendrian links.
problem Exact Lagrangian fillings of Legendrian links of Dn-type. method Legendrian weave calculus and construction of 1-cycles.
result Existence of a Lagrangian filling represented by a weave.
The paper connects different types of Lagrangian fillings to Legendrian weaves and their sheaf quantizations.
problem Understanding and comparing different types of Lagrangian fillings of Legendrian weaves.
method Establishing new Reidemeister moves and combinatorial isotopies between Lagrangian fillings, comparing sheaf quantizations.
result Legendrian weaves generalize previously known methods to produce infinitely many distinct Lagrangian fillings.
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute the known polynomial invariants of knots using their braid representations. In th…
In this paper we compute the signature for a family of knots W(k,n), the weaving knots of type (k,n). By work of E.~S.~Lee the signature calculation implies a vanishing theorem for the Khovanov homology of weaving knots. Specializing to knots W(3,n), we develop recursion relations that enable us to compute the Jo…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to diagrams of the initial object. The main tool is the notion of {\em free k-braid …
New method weaves paper strips for designing curved surfaces with elasticity.
problem Designing general curved surfaces with geometrical elasticity.
method Shape optimization of paper strips using nonlinear elasticity theory.
result Demonstrated creation of catenoid and helicoid surfaces with 54 paper strips.
In target tracking, the estimation of an unknown weaving target frequency is crucial for improving the miss distance. The estimation process is commonly carried out in a Kalman framework. The objective of this paper is to examine the potential of using neural networks in target tracking applications. To that end, we pr…
Study identifies stable configurations of intertwined threads with repulsive interactions.
problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3 rate. 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.
Machine learning is often used in virtual screening to find compounds that are pharmacologically active on a target protein. The weave module is a type of graph convolutional deep neural network that uses not only features focusing on atoms alone (atom features) but also features focusing on atom pairs (pair features);…
We investigate several conjectures in geometric topology by assembling computer data obtained by studying weaving knots, a doubly infinite family W(p,n) of examples of hyperbolic knots. In particular, we compute some important polynomial knot invariants, as well as knot homologies, for the subclass W(3,n) of this f…
Study detects a specific type of link using annular Khovanov homology.
problem Detecting a specific type of three-strand weaving link.
method Combines braid detection with rigidity theorem to determine (σ1σ2−1)N up to conjugacy. result Annular Khovanov homology detects the underlying unoriented annular link KN. The paper connects Legendrian links to cluster algebras via microlocal methods.
problem Understanding the relationship between Legendrian links and cluster algebras.
method Microlocal parallel transport of sheaf quantizations of Lagrangian fillings.
result Existence of quasi-cluster A-structures and cluster Poisson structures. Generalizing previous constructions, we present a dual pair of decompositions of the complement of a link L into bipyramids, given any multi-crossing projection of L. When L is hyperbolic, this gives new upper bounds on the volume of L given its multi-crossing projection. These bounds are realized by three closely rela…
TempoPFN models for zero-shot time series forecasting using synthetic data.
problem Efficient long-horizon prediction and reproducibility in zero-shot time series forecasting.
method Linear RNNs pre-trained on synthetic data with GatedDeltaProduct architecture and state-weaving.
result Achieves top-tier competitive performance on various benchmarks.
Proves certain alternating links have specific geometric properties.
problem Characterizing alternating links with totally geodesic checkerboard surfaces.
method Analyzes links with two totally geodesic checkerboard surfaces and characterizes them.
result Proves links with two totally geodesic checkerboard surfaces are three specific links.
New surfaces with special geodesic and horocycle behaviors discovered.
problem Understanding geodesic and horocycle dynamics on hyperbolic surfaces.
method Constructing geometrically infinite hyperbolic surfaces with tailored recurrence properties.
result First examples of non-trivial minimal horocyclic orbit closures and infinite locally-finite conservative horocyclic invariant measures.
Study Legendrian surfaces using N-graphs and flag moduli.
problem Characterize and apply Legendrian surfaces in contact geometry.
method Develop diagrammatic calculus and algebraic-geometric characterization.
result Show applications in Lagrangian concordance, exact fillings, and rational point counts.
New dg-algebras link graph colorings to sheaves.
problem Linking graph colorings to sheaves for Legendrian surfaces.
method Generalized Casals-Murphy dg-algebra to non-commutative coefficients and computed Legendrian contact dg-algebra.
result Rank r representations of dg-algebras correspond to colorings of faces in Grassmannian.
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.
Modeling of a wide class of physical phenomena, such as crystal growth and flame propagation, leads to tracking fronts moving with curvature-dependent speed. When the speed is the curvature this leads to one of the classical degenerate nonlinear second order differential equations on Euclidean space. One naturally wond…
This note explains how to transform Heegaard diagrams into framed link diagrams.
problem No specific problem stated; transformation of diagrams is the focus.
method Explains a procedure to transform Heegaard diagrams into framed link diagrams.
result Demonstrates a method to transform Heegaard diagrams into framed link diagrams.
We are enveloped by stories of visual interpretations in our everyday lives. The way we narrate a story often comprises of two stages, which are, forming a central mind map of entities and then weaving a story around them. A contributing factor to coherence is not just basing the story on these entities but also, refer…
New minimal link diagrams found, including torus links and homogeneous ones.
problem Finding minimal link diagrams with new classes.
method Morton-Franks-Williams inequality approach.
result New classes of minimal link diagrams, including previously unproven ones.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
problem Creating efficient trisection diagrams for 4-manifolds.
method Algorithm converting Kirby diagrams to trisection diagrams.
result Provides examples of trisection diagrams for 4-manifolds.
Unified approach to learn interpretable concepts from data.
problem Building interpretable machine learning models and highly-performing foundation models.
method Relating causal representation learning and foundation models, defining concepts and proving their recoverability.
result Provable recovery of human-interpretable concepts from diverse data.
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.
This paper upbuilds the theoretical framework of orbit braids in M×I by making use of the orbit configuration space FG(M,n), which enriches the theory of ordinary braids, where M is a connected topological manifold of dimension at least 2 with an effective action of a finite group G and the action of G…
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 …
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.
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.
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…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
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.
Table of symmetric diagrams for knots up to 10 crossings.
problem Finding symmetric diagrams for strongly invertible knots.
method Compilation of symmetric diagrams for knots up to 10 crossings.
result Similarity of transversal diagrams to symmetric union diagrams for strongly invertible knots.
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…
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.