相关论文: Is a Knot Classification possible?
Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.
Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of what constitutes a community has remained evasive, community…
We introduce a collection of complex networks generated by a combination of preferential attachment and a previously unexamined process of "splitting" nodes of degree $k$ into $k$ nodes of degree 1. Four networks are considered, each…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Classifying large scale networks into several categories and distinguishing them according to their fine structures is of great importance with several applications in real life. However, most studies of complex networks focus on properties…
Global textures are interesting because they are promising candidates for seeds in the structure formation of the universe. The important configurations are those who will be able to collapse. The type of configurations that I will consider…
An efficient numerical algorithm for the computation of linking number is presented. The algorithm keep tracks or rounding error so that it can ensure the correctness of the results.
Reductivity of knot projections refers to the minimum number of splices of double points needed to obtain reducible knot projections. Considering the type and method of splicing (Seifert type splice or non-Seifert type splice, recursively…
It has been suggested recently that knots might exist as stable soliton solutions in a simple three-dimensional classical field theory, opening up a wide range of possible applications in physics and beyond. We have re-examined and extended…
While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to…
In this paper, we introduce a new type of relation between knots called the descendant relation. One knot $H$ is a descendant of another knot $K$ if $H$ can be obtained from a minimal crossing diagram of $K$ by some number of crossing…
We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
The knot Floer complex and the concordance invariant $\varepsilon$ can be used to define a filtration on the smooth concordance group. We exhibit an ordered subset of this filtration that is isomorphic to $\mathbb{N} \times \mathbb{N}$ and…
The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, the design of an efficient and effective…
A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
Community detection in networks is one of the most popular topics of modern network science. Communities, or clusters, are usually groups of vertices having higher probability of being connected to each other than to members of other…
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence…