Related papers: An Algorithmic Definition of Gabai Width
In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we…
We consider the question of which virtual knots have finite fundamental medial bikei. We describe and implement an algorithm for completing a presentation matrix of a medial bikei to an operation table, determining both the cardinality and…
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
By a well known result the treewidth of k-outerplanar graphs is at most 3k-1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i.e. it is shown that, given a k-outerplanar graph G, a tree…
We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.
The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we determine the $6$-girth-thickness $\theta(6,K_n)$ of the complete graph $K_n$ in…
We describe an algorithm for listing all elements of bounded height in a given number field.
We compute the treewidth of a family of graphs we refer to as the glued grids, consisting of the stacked prism graphs and the toroidal grids. Our main technique is constructing strict brambles of large orders. We discuss connections to…
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…
We study the incompressible surfaces in the exterior of a cable knot and use this to compute the representativity and waist of most cable knots.
A knot $K$ is definite if $|\sigma(K)| = 2g(K)$. We prove that the quotient of a definite periodic knot is definite by considering equivariant minimal genus Seifert surfaces.
We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
We apply Bayesian optimization and reinforcement learning to a problem in topology: the question of when a knot bounds a ribbon disk. This question is relevant in an approach to disproving the four-dimensional smooth Poincar\'e conjecture;…
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…
A ribbon is a two-dimensional object with one-dimensional properties which is related with geometry, robotics and molecular biology. A folded ribbon structure provides a complex structure through a series of folds. We focus on a folded…
A knot $K_1$ is said to be Gordian adjacent to a knot $K_2$ if $K_1$ is an intermediate knot on an unknotting sequence of $K_2$. We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between…
We compute the Kauffman bracket skein module of the complement of a twist knot, finding that it is free and infinite dimensional. The basis consists of cables of a two-component link, one component of which is a meridian of the knot. The…
We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a folded ribbon knot. We show for any knot or link type that there exist…