Related papers: Knot Tightening By Constrained Gradient Descent
The optimization foundations of deep linear networks have recently received significant attention. However, due to their inherent non-convexity and hierarchical structure, analyzing the loss functions of deep linear networks remains a…
In this brief note, we investigate the $\mathbb{CP}^2$-genus of knots, i.e. the least genus of a smooth, compact, orientable surface in $\mathbb{CP}^2\setminus \mathring{B^4}$ bounded by a knot in $S^3$. We show that this quantity is…
Inspired by how certain proteins "sense" knots and entanglements in DNA molecules, here we ask if there exist local geometric features that may be used as a read-out of the underlying topology of generic polymers. We perform molecular…
For the numerical solution of shape optimization problems, particularly those constrained by partial differential equations (PDEs), the quality of the underlying mesh is of utmost importance. Particularly when investigating complex…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
We are giving tables of quasi-alternating knots with $8\le n \le 12$ crossings. As the obstructions for a knot to be quasialternating we used homology thickness with regards to Khovanov homology, odd homology, and Heegaard-Floer homology…
Our main result is a nontrivial lower bound for the distortion of some specific knots. In particular, we show that the distortion of the torus knot $T_{p,q}$ satisfies $\delta(T_{p,q})>\frac 1{160}\min(p,q)$. This answers a 1983 question of…
We say that two knots are friends if they share the same 0-surgery. Two friends with different sliceness status would provide a counterexample to the 4-dimensional smooth Poincar\'e conjecture. Here we create a census of all friends with…
In this paper we study the Spanning Tree Congestion problem, where we are given a graph $G=(V,E)$ and are asked to find a spanning tree $T$ of minimum maximum congestion. Here, the congestion of an edge $e\in T$ is the number of edges…
The concordance genus of a knot K is the minimum three-genus among all knots concordant to K. For prime knots of 10 or fewer crossings there have been three knots for which the concordance genus was unknown. Those three cases are now…
Two aspects of neural networks that have been extensively studied in the recent literature are their function approximation properties and their training by gradient descent methods. The approximation problem seeks accurate approximations…
We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products…
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We propose new strategies to handle polygonal grids refinement based on Convolutional Neural Networks (CNNs). We show that CNNs can be successfully employed to identify correctly the "shape" of a polygonal element so as to design suitable…
We define the knotting probability of a knot $K$ by the probability for a random polygon (RP) or self-avoiding polygon (SAP) of $N$ segments having the knot type $K$. We show fundamental and generic properties of the knotting probability…
The interplay of topological constraints and Coulomb interactions in static and dynamic properties of charged polymers is investigated by numerical simulations and scaling arguments. In the absence of screening, the long-range interaction…
Entangled networks of stiff biopolymers exhibit complex dynamic response, emerging from the topological constraints that neighboring filaments impose upon each other. We propose a class of reference models for entanglement dynamics of stiff…
We study networks in $\R^n$ which are periodic under a lattice of rank~$n$ and have vertices of prescribed degree $d\ge 3$. We minimize the length of the quotient networks, subject to the constraint that the fundamental domain has…
This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…