Related papers: Computing the crosscap number of a knot using inte…
Patients with motor control difficulties often "type" on a computer using a switch keyboard to guide a scanning cursor to text elements. We show how to optimize some parts of the design of switch keyboards by casting the design problem as…
Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in $\mathbb{S}^3$. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…
We study a general class of bilevel problems, consisting in the minimization of an upper-level objective which depends on the solution to a parametric fixed-point equation. Important instances arising in machine learning include…
We develop and implement an algorithm that computes the full knot Floer complex of knots of thickness one. As an application, by extending this algorithm to certain knots of thickness two, we show that all but finitely many non-integral…
An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…
Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite…
We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…
We study lower bounds on the worst-case error of numerical integration in tensor product spaces. As reference we use the $N$-th minimal error of linear rules that use $N$ function values. The information complexity is the minimal number $N$…
Spanners have been shown to be a powerful tool in graph algorithms. Many spanner constructions use a certain type of clustering at their core, where each cluster has small diameter and there are relatively few spanner edges between…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
The purpose of this paper is to discuss the categorical structure for a method of defining quantum invariants of knots, links and three-manifolds. These invariants can be defined in terms of right integrals on certain Hopf algebras. We call…
The ribbon number of a knot is the minimum number of ribbon singularities among all ribbon disks bounded by that knot. In this paper, we build on the systematic treatment of this knot invariant initiated in recent work of Friedl, Misev, and…
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…
Cone regression is a particular case of quadratic programming that minimizes a weighted sum of squared residuals under a set of linear inequality constraints. Several important statistical problems such as isotonic, concave regression or…
There is a class of entropy-coding methods which do not substitute symbols by code words (such as Huffman coding), but operate on intervals or ranges. This class includes three prominent members: conventional arithmetic coding, range…
The split common fixed-point problem is an inverse problem that consists in finding an element in a fixed-point set such that its image under a bounded linear operator belongs to another fixed-point set. Recently Censor and Segal proposed…
Optical knots and links have attracted great attention because of their exotic topological characteristics. Recent investigations have shown that the information encoding based on optical knots could possess robust features against external…
Integer counting processes increment of an integer value at transitions between states of an underlying Markov process. The generator of a counting process, which depends on a parameter conjugate to the increments, defines a complex…