arXiv research

Polynomial invariants classify molecular chains based on their contact arrangements.

New method measures entanglement of open and closed curves.

Formulae for Yamada polynomial of spatial graphs are derived from edge replacements.

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations of the Tutte polynomial of graphs. Also, for each graph and integer $n\le 2$, w…

Study shows torsion homology growth vanishes for certain free-by-cyclic groups.

The Kauffman bracket polynomial is calculated for specific Turk's head knots.

New methods assess topological entanglement in periodic systems.

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic properties of such chain complexes, including long-exact sequences associated to deletio…

Researchers determine the Thurston unit ball for a family of $n$-chained links and find conditions for fibered faces.

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain com…

Classifies uncolored bonded knots with up to 7 singularity points.

Study on gradient descent in Hilbert spaces with Markov chains, focusing on mixing coefficients.

The paper calculates the asymptotics of quantum invariants for Whitehead chains.

In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with graded Euler characteristic equal to the Jones polynomial of the link. Hence, it can…

Study on identifying AMP chain graph models under known and unknown component decompositions.

Study character variety of a special 3-manifold, finding a polynomial formula.

Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…

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

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were shown to be NP-complete and NP-hard respectively. However, there is evidence that …

Polynomial mixing times for simulated tempering in mixture sampling problems.

Proof of isotopy invariance in Khovanov link homology.

In [Duke Math. J. 101 (1999) 359-426], Mikhail Khovanov constructed a homology theory for oriented links, whose graded Euler characteristic is the Jones polynomial. He also explained how every link cobordism between two links induces a homomorphism between their homology groups, and he conjectured the invariance (up to…

Develops fractional de Rham theory for Maxwell equations.

We compute different versions of link Floer homology $HFL^{-}$ and $\widehat{HFL}$ for any $L$-space link with two components. The main approach is to compute the $h$-function of the filtered chain complex which is determined by the Alexander polynomials of every sublink of the $L$-space link. As an application, Thurst…

Bayesian approach improves sparse PCE for high-dimensional problems.

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…

Alexander polynomial derived from knot contact homology and Floer strips.

Algorithm samples from Bingham distribution efficiently.

New stabilization method in graph braid homology yields polynomial growth.

New local-search methods close the gap in sparse tensor PCA.

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the knot in the 3--sphere. We show that the degrees of twisted Alexander polynomial…

New algorithm finds approximate minimizers for noisy convex functions.

We construct an action of a polynomial ring on the colored sl(2) link homology of Cooper-Krushkal, over which this homology is finitely generated. We define a new, related link homology which is finite dimensional, extends to tangles, and categorifies a scalar-multiple of the sl(2) Reshetikhin-Turaev invariant. We expe…

Constant-time approximation of partition functions for dense models.

In this paper, we examine mapping class group relations of some symplectic manifolds. For each $n\geq 1$ and $k \geq 1$, we show that the $2n$-dimensional Weinstein domain $W = \{f=δ\} \cap B^{2n+2}$, determined by the degree $k$ homogeneous polynomial $f\in \mathbb{C}[z_0,\dots,z_n]$, has a Boothby-Wang type boundary …

Proves subgaussian distributions are SoS-certifiably subgaussian, enabling efficient algorithms for various statistical tasks.

We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider the task of rapidly sampling from such constrained measures, and develop fast M…

New geometric object for polynomials simplifies complex data.

Study online learning in RKHS with dependent processes, focusing on \(β\)- and \(φ\)-mixing.

The study extends GBM to include stable nonzero prices and finds a pronounced potential well.

Smooth curves from polygonal chains with vertex preservation and explicit curvature control.

Let $G$ be a signed graph. Let $\hat{G}$ be the graph obtained from $G$ by replacing each edge $e$ by a chain or a sheaf. We first establish a relation between the $Q$-polynomial of $\hat{G}$[6] and the $W$-polynomial of $G$ [9]. Two special dual cases are derived from the relation, one of which has been studied in [8]…

New algorithm samples from log-concave distributions with high accuracy in polynomial time.

We define a family of formal Khovanov brackets of a colored link depending on two parameters. The isomorphism classes of these brackets are invariants of framed colored links. The Bar-Natan functors applied to these brackets produce Khovanov and Lee homology theories categorifying the colored Jones polynomial. Further,…

New bounds for SMC show its advantage over MCMC in multimodal distributions.

We study dual volume sampling, a method for selecting k columns from an n x m short and wide matrix (n <= k <= m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method was proposed by Avron and Boutsidis (2013), who showed it to be a promising met…

Khovanov homology detects essential surfaces in knot complements.