Related papers: Algorithms for Skein Manipulation in a Genus-2 Han…
This paper presents a learning-based method to solve the traditional parameterization and knot placement problems in B-spline approximation. Different from conventional heuristic methods or recent AI-based methods, the proposed method does…
Convolutional neural networks are prevailing in deep learning tasks. However, they suffer from massive cost issues when working on mobile devices. Network pruning is an effective method of model compression to handle such problems. This…
We introduce several algebraic structures related to handlebody-knots, including $G$-families of biquandles, partially multiplicative biquandles and group decomposable biquandles. These structures can be used to color the semiarcs in…
Genus 2 mutation is the process of cutting a 3-manifold along an embedded closed genus 2 surface, twisting by the hyper-elliptic involution, and gluing back. This paper compares genus 2 mutation with the better-known Conway mutation in the…
In this paper we present recent results toward the computation of the HOMFLYPT skein module of the lens spaces $L(p,1)$, $\mathcal{S}\left(L(p,1) \right)$, via braids. Our starting point is the knot theory of the solid torus ST and the…
We present a general method for rendering representations of multi-stranded DNA complexes from textual descriptions into 2D diagrams. The complexes can be arbitrarily pseudoknotted, and if a planar rendering is possible, the method will…
We propose a scalable approximate algorithm for the NP-hard maximum-weight independent set problem. The core component of our algorithm is a dual coordinate descent applied to a smoothed LP relaxation of the problem. This technique is…
It is natural to try to place the new polynomial invariants of links in algebraic topology (e.g. to try to interpret them using homology or homotopy groups). However, one can think that these new polynomial invariants are byproducts of a…
Although part-based motion synthesis networks have been investigated to reduce the complexity of modeling heterogeneous human motions, their computational cost remains prohibitive in interactive applications. To this end, we propose a novel…
Structured pruning is an effective approach for compressing large pre-trained neural networks without significantly affecting their performance. However, most current structured pruning methods do not provide any performance guarantees, and…
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this…
The representation theory of a 3-dimensional Sklyanin algebra $S$ depends on its (noncommutative projective algebro-) geometric data: an elliptic curve $E$ in $\mathbb{P}^2$, and an automorphism $\sigma$ of $E$ given by translation by a…
This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…
A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…
A 2-dimensional braid over an oriented surface-knot $F$ is presented by a graph called a chart on a surface diagram of $F$. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. We focus on algorithms in which convolution with the point-spread function to be deconvolved is used in each iteration, and aim at accelerating…
We study the algebraic and geometric properties of stated skein algebras of surfaces with punctured boundary. We prove that the skein algebra of the bigon is isomorphic to the quantum group ${\mathcal O}_{q^2}(\mathrm{SL}(2))$ providing a…
In this paper, we develop a method for unsupervised clustering of two-way (matrix) data by combining two recent innovations from different fields: the Sparse Subspace Clustering (SSC) algorithm [10], which groups points coming from a union…
We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to first-order methods, our understanding of second-order…