arXiv research

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph Reidemeister moves, generalizing the Dehn presentation of the knot group analogously to…

Smooth manifolds can be triangulated with graphs of bounded twin-width.

The main results in this paper provide upper bounds of the second order Dehn functions for three-dimensional groups Nil and Sol. These upper bounds are obtained by using the Varopoulos transport argument on dual graphs. The first step is to start with reduced handlebody diagrams of the three-dimensional balls either im…

Deep learning model predicts protein-ligand binding modes from docking data.

This paper improves upper bounds on ribbonlength for certain alternating links.

Predicting interactions between structured entities lies at the core of numerous tasks such as drug regimen and new material design. In recent years, graph neural networks have become attractive. They represent structured entities as graphs and then extract features from each individual graph using graph convolution op…

We describe a new family of triply-periodic minimal surfaces with hexagonal symmetry, related to the quartz (qtz) and its dual (the qzd net). We provide a solution to the period problem and provide a parametrisation of these surfaces, that are not in the regular class, by the Weierstrass-Enneper formalism. We identifie…

We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan polynomials of dual graphs. This relation unifies various recent results expressing the J…

The study connects geodesic flows on Riemann surfaces to random walks on their dual graphs.

We consider an embedding of a $2$-dimensional CW complex into the $3$-sphere, and construct it's dual graph. Then we obtain a homogeneous system of linear equations from the $2$-dimensional CW complex in the first homology group of the complement of the dual graph. By checking that the homogeneous system of linear equa…

Study classifies Morse functions with 4 critical points on immersed 2-spheres.

A formula calculates the Euler class of foliations using dual graphs.

CMC-1 surfaces linked via Möbius transformations between circle patterns.

engGNN combines external and generated graphs to improve disease classification and biomarker discovery.

The article studies embeddings of edge-colored graphs related to balanced 3- and 4-manifolds.

Study of height jumps in Ceresa cycle using asymptotic Hodge theory.

Improved pathwidth bound for hyperbolic 3-manifolds.

In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In addition, in the appendix by K. Sackel the F(q)-rational points of its graded a…

The paper explores algorithms to transform 3-manifold triangulations while controlling sparsity.

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the polynomial, defined by M.Las Vergnas in a combinatorial way using matroids as a spec…

New method calculates Thurston norm for 3-manifolds with toroidal boundaries.

In this paper, we build on the biquasiles and dual graph diagrams introduced in arXiv:1610.06969. We introduce \textit{biquasile Boltzmann weights} that enhance the previous knot coloring invariant defined in terms of finite biquasiles and provide examples differentiating links with the same counting invariant, demonst…

Develops G-MLKM for better data-target association in constrained spaces.

We describe the closure of the strata of abelian differentials with prescribed type of zeros and poles, in the projectivized Hodge bundle over the Deligne-Mumford moduli space of stable curves with marked points. We provide an explicit characterization of pointed stable differentials in the boundary of the closure, bot…

In this paper, we propose a semi-supervised dictionary learning method that uses both the information in labelled and unlabelled data and jointly trains a linear classifier embedded on the sparse codes. The manifold structure of the data in the sparse code space is preserved using the same approach as the Locally Linea…

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic …

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 examines topological features of ReLU networks and their relation to decision boundaries and training loss.

Let a $A$ be the 1-skeleton of a triangulated topological annulus. We establish bounds on the combinatorial modulus of a refinement $A'$, formed by attaching new vertices and edges to $A$, that depend only on the refinement and not on the structure of $A$ itself. This immediately applies to showing that a disk triangul…

In Arakelov theory a completion of an arithmetic surface is achieved by enlarging the group of divisors by formal linear combinations of the ``closed fibers at infinity''. Manin described the dual graph of any such closed fiber in terms of an infinite tangle of bounded geodesics in a hyperbolic handlebody endowed with …

CADE learns dual node representations for better generalization.

In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal surfaces, we seek examples of triply periodic polyhedral surfaces that have an identifia…

The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 2^{2g} matrices, where g is the genus of a surface in which G embeds. We show that in the case of isoradially embedded graphs with critical weights, these determinants have quite remarkable properties. Firs…

In a recent work of Ayaka Shimizu$^{[5]}$, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…

Paper studies gradient fields from discrete Morse functions for watershed-cut computation.

DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.

Study on crystallized polyominoes with minimum tiles and structural properties.

Classifies doodles into prime and super prime types, describing them with doodle codes.

We find all $P$-resolutions of quotient surface singularities (especially, tetrahedral, octahedral, and icosahedral singularities) together with their dual graphs, which reproduces Jan Steven's list [Manuscripta Math. 1993] of the numbers of $P$-resolutions of each singularities. We then compute the dimensions and Miln…

We call an Ising model tractable when it is possible to compute its partition function value (statistical inference) in polynomial time. The tractability also implies an ability to sample configurations of this model in polynomial time. The notion of tractability extends the basic case of planar zero-field Ising models…

In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a general class of triangulations of arbitrary fixed dimension d, including all t…

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

New approach to electric group for knots and links.

Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, through a reduction to the erasability problem. Here, we refine the stu…

Classifies theories with eight supercharges using pseudo-periodic maps and Riemann surfaces.

This paper completes the classification of certain surface singularities with rational homology disk smoothings.

The flip graph and arc complex of a surface are shown to have finite rigidity.

Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we show that a "sufficiently complicated" JSJ decomposition of a 3-manifold enforces a…