arXiv research

A polynomial counts knot states for a specific type of knot.

Origami structures are enumerated and shown to be quantum modular.

This paper proves that lattice point enumeration in moduli spaces satisfies topological recursion.

Enumerates knots up to five crossings and describes moves between them.

New framework for 3D spatial topology enumeration and identification.

Paper categorifies a polynomial related to ribbon graphs.

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to triangulations.

We show that for a special alternating link diagram, the following three polynomials are essentially the same: a) the part of the HOMFLY polynomial that corresponds to the leading term in the Alexander polynomial; b) the $h$-vector for a triangulation of the root polytope of the Seifert graph and c) the enumerator of p…

We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top degree coefficients tautological intersection numbers on the compactified moduli spac…

The paper analyzes a simple neural network model with algebraic methods.

The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in $\mathbb{C}$. Further we enumerate all non-trivial colorings of a torus knot diagram by the quandle u…

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors deve…

Complete classification of knotoids up to seven crossings.

In 2006, Fock and Goncharov constructed a nice basis of the ring of regular functions on the moduli space of framed ${\rm PGL}_2$-local systems on a punctured surface $S$. The moduli space is birational to a cluster $\mathcal{X}$-variety, whose positive real points recover the enhanced Teichmüller space of $S$. Their b…

We consider complements of standard Seifert surfaces of special alternating links. On these handlebodies, we use Honda's method to enumerate those tight contact structures whose dividing sets are isotopic to the link, and find their number to be the leading coefficient of the Alexander polynomial. The Euler classes of …

New algorithms explain Naive Bayes classifiers in polynomial time and delay.

Paper introduces algorithms for explaining monotonic classifiers.

Criterion for stopping conjugacy class enumeration in triangle groups.

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed their Jones polynomials by a divide-and-conquer method, and tested those with triv…

We announce a solution to several enumeration problems in topology of surfaces. This includes an enumeration of homotopy classes of sections of locally trivial fiber bundles over surfaces and a computation of non-abelian 1-cohomology of surfaces.

Enumerated all genus two handlebody-knots with seven crossings.

This paper improves robust cluster enumeration for RES data.

The article enumerates doubly symmetric diagrams for knots up to 18 crossings.

This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link diagram of a given minimal crossing size and by applications of just two operators (T …

Constructive approach to Lie algebra gradings, computing maximal and enumerating all gradings.

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how …

This paper reformulates double Hurwitz numbers using topological recursion.

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers occur as determinants of prime alternating achiral knots, and obtain a complete re…

The paper proposes an algorithm to enumerate K best models with distinct support vectors for SVM.

In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been v…

Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single cau…

New method estimates number of clusters robustly in noisy data.

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph we enumerate all corresponding knot projections, and after that we construct the…

New method finds 198,846 toric-colorable seeds of Picard number 5.

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

Given a presentation for a rack $\mathcal R$, we define a process which systematically enumerates the elements of $\mathcal R$. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes and improves the diagramming method for $n$-quandles introduced by Winker. We p…

We present a technique for the enumeration of all isotopically distinct ways of tiling a hyperbolic surface of finite genus, possibly nonorientable and with punctures and boundary. This provides a generalization of the enumeration of Delaney-Dress combinatorial tiling theory on the basis of isotopic tiling theory. To a…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings in terms of their generating functions. We show in particular how Fibonacci numb…

Let M be a compact, hyperbolizable 3-manifold with nonempty incompressible boundary and let AH(π_1(M)) denote the space of (conjugacy classes of) discrete faithful representations of π_1(M) into PSL 2 (C). The components of the interior MP(π_1(M)) of AH(π_1(M)) (as a subset of the appropriate representation variety) ar…

This paper deals with the enumeration of the higher order non-trivial compositions of the differential operations and the directional derivative in the space $R^n$ ($n \geq 3$). We present the recurrences for a counting the higher order non-trivial compositions.

The study enumerates virtual quandles up to isomorphism.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

Study geometric bases for A-polynomials in SU(3) using arcade formalism.

The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

We enumerate the small-volume manifolds that can be obtained by Dehn filling on Mom-2 and Mom-3 manifolds as defined by Gabai, Meyerhoff, and the author. In so doing we complete the proof that the Weeks manifold is the minimum-volume compact hyperbolic 3-manifold, as well as enumerating the 10 smallest one-cusped hyper…

New method uses Gaussian processes to find local minima efficiently.

We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well known link projections. This gives a method of enumerating atoroidal graphs and he…

We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of act…