Related papers: Discrete Knot Theory via Lattice-Filtered Move Gra…
In recent years, deep learning based methods have shown success in essential medical image analysis tasks such as segmentation. Post-processing and refining the results of segmentation is a common practice to decrease the misclassifications…
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
A scalable tight-binding model is applied for large-scale quantum transport calculations in clean graphene subject to electrostatic superlattice potentials, including two types of graphene superlattices: moir\'e patterns due to the stacking…
We study the identifiability of nonlinear network systems with partial excitation and partial measurement when the network dynamics is linear on the edges and nonlinear on the nodes. We assume that the graph topology and the nonlinear…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
This work generalizes our previous works on fcc-bcc martensitic transformations to the larger family of transformations in the fcc-bcc-hcp system and to fcc-fcc mechanical twinning. The analytical expressions of the atomic displacements and…
Divergence functions of a metric space estimate the length of a path connecting two points $A$, $B$ at distance $\le n$ avoiding a large enough ball around a third point $C$. We characterize groups with non-linear divergence functions as…
Singular knot theory extends classical knot theory by allowing transverse double points without over/under information, together with singular Reidemeister moves of types IV and V. A central open problem in this theory is to determine the…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
Artificial graphene consisting of honeycomb lattices other than the atomic layer of carbon has been shown to exhibit electronic properties similar to real graphene. Here, we reverse the argument to show that transport properties of real…
For any Carter diagram $\Gamma$ containing 4-cycle, we introduce the partial Cartan matrix $B_L$, which is similar to the Cartan matrix associated with a Dynkin diagram. A linkage diagram is obtained from $\Gamma$ by adding one root…
In this paper, we introduce a ``CFT factory'' : a novel algorithm of methodically generating 2D lattice models that would flow to 2D conformal fixed points in the infrared. These 2D models are realised by giving critical boundary conditions…
DNA-coated colloids are a popular model system for self-assembly through tunable interactions. The DNA-encoded linkages between particles theoretically allow for very high specificity, but generally no directionality or long-range…
Asymmetric exclusion processes for particles moving on parallel channels with inhomogeneous coupling are investigated theoretically. Particles interact with hard-core exclusion and move in the same direction on both lattices, while…
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot…
In the emerging field of mechanical metamaterials, using periodic lattice structures as a primary ingredient is relatively frequent. However, the choice of aperiodic lattices in these structures presents unique advantages regarding failure,…
A delta-move is a local move on a link diagram. The delta-Gordian distance between links measures the minimum number of delta-moves needed to move between link diagrams. A self delta-move only involves a single component of a link whereas a…
In this paper, we approach the challenging problem of motion planning for knot tying. We propose a hierarchical approach in which the top layer produces a topological plan and the bottom layer translates this plan into continuous robot…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…