相关论文: Arc-presentations of links. Monotonic simplificati…
It was shown by Jim Davis that a 2-component link with Alexander polynomial one is topologically concordant to the Hopf link. In this paper, we show that there is a 2-component link with Alexander polynomial one that has unknotted…
After recalling the definition of connectivity spaces and some of their main properties, a way is proposed to represent finite connectivity spaces by directed simple graphs. Then a connectivity structure is associated to each tame link. It…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a…
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
Complex networks can be understood as graphs whose connectivity deviates from those of regular or near-regular graphs, which are understood as being `simple'. While a great deal of the attention so far dedicated to complex networks has been…
A representation of the central extension of the unitary Lie algebra coordinated with a skew Laurent polynomial ring is constructed using vertex operators over an integral Z_2-lattice. The irreducible decomposition of the representation is…
Elementary complex analysis and Hilbert space methods show that a union of at most n arcs on the circle is uniquely determined by the nth Fourier partial sum of its characteristic function. The endpoints of the arcs can be recovered from…
We propose stochastic splitting algorithms for solving large-scale composite inclusion problems involving monotone and linear operators. They activate at each iteration blocks of randomly selected resolvents of monotone operators and,…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
We show that the subgroup of the knot concordance group generated by links of isolated complex singularities intersects the subgroup of algebraically slice knots in an infinite rank subgroup.
We present a fast multiscale approach for the network minimum logarithmic arrangement problem. This type of arrangement plays an important role in a network compression and fast node/link access operations. The algorithm is of linear…
We extend knot contact homology to a theory over the ring $\mathbb{Z}[\lambda^{\pm 1},\mu^{\pm 1}]$, with the invariant given topologically and combinatorially. The improved invariant, which is defined for framed knots in $S^3$ and can be…
To solve MHD problems within the framework of the theory of two-scale mean fields, it is important to study the invariants of magnetic lines. Such invariants are constructed on the basis of invariants of classical links, which must satisfy…
This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…