Signature invariants of covering links

We apply the theory of signature invariants of links in rational homology spheres to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, we derive an explicit formula to compute signature invariants of their covering links. Using the formula, we produce fused boundary links that are positive mutants of ribbon links but are not concordant to boundary links. We also show that for any finite collection of patterns, there are homology boundary links that are not concordant to any homology boundary links admitting a pattern in the collection.

     

Classification of oriented Montesinos links by invariants of spin structures

In this paper we give the isotopy classification of oriented Montesinos links. The definition of the invariants of links needed for this and the proof of the classification theorem are based on a new construction, which establishes a correspondence between orientations of a link S ⁿ on the one hand, and spin structures on the two-sheeted branched covering of the sphere, branched over l, on the other. New numerical invariants of spin structures on three-dimensional Seifert manifolds are introduced in the paper; these invariants are used to classify the Montesinos links.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 143, pp. 130–146, 1985.     

Soap films and covering spaces

A new mathematical model of soap films is proposed, called the “covering space model.” The two sides of a film are modeled as currents on different sheets of a covering space branching along the film boundary. Hence a film may be seen as the minimal cut separating one sheet of the covering space from the others. The film is thus the oriented boundary of one sheet, which represents the exterior of the film. As oriented boundaries, films may be calibrated with differential forms on the covering space, a version of the min-cut, max-flow duality of network theory. This model applies to unoriented films, films with singularities, films touching only part of a knotted curve, films that deformation retract to their boundaries, and other examples that have proved troublesome for previous soap film models. Communicated by Frederick Almgren     

Determining Knotsw and Links by Cyclic Branched Coverings

It is well known that different knots or links in the 3-sphere can have homeomorphic n-fold cyclic branched coverings. We consider the following problem: for which values of nis a knot of link determined by itsn-fold cyclic branched covering? We consider the class of hyperbolic resp.2π/n-hyperbolic links. The isometry or symmetry groups of such links are finite, and their n-fold branched coverings are hyperbolic 3-manifolds. Our main result states that if ndoes not divide the order of the finite symmetry group of such a link, then the link is determined by its n-fold branched covering. In a sense, the result is best possible; the key argument of its proof is algebraic using some basic result about finite p-groups. The main result applies, for example, to the cyclic branched coverings of the 2-bridge links; in particular, it gives a classification of the maximally symmetricD₆-manifolds which are exactly the 3-fold branched coverings of the 2-bridge links.     

Writhe polynomials and shell moves for virtual knots and links

The writhe polynomial is a fundamental invariant of an oriented virtual knot. We introduce a set of local moves for oriented virtual knots called shell moves. The first aim of this paper is to prove that two oriented virtual knots have the same writhe polynomial if and only if they are related by a finite sequence of shell moves. The second aim of this paper is to classify oriented 2-component virtual links up to shell moves by using several invariants of virtual links.     

Polynomial invariants and quandles of twisted links

Bourgoin defined the notion of a twisted link which corresponds to a stable equivalence class of links in oriented thickenings. It is a generalization of a virtual link. Some invariants of virtual links are extended for twisted links including the knot group and the Jones polynomial. In this paper, we generalize a multivariable polynomial invariant of a virtual link to a twisted link. We also introduce a quandle of a twisted link.     

Oriented walk double covering and bidirectional double tracing

An oriented walk double covering of a graph G is a set of oriented closed walks, that, traversed successively, combined will have traced each edge of G once in each direction. A bidirectional double tracing of a graph G is an oriented walk double covering that consists of a single closed walk. A retracting in a closed walk is the immediate succession of an edge by its inverse. Every graph with minimum degree 2 has a retracting free oriented walk double covering and every connected graph has a bidirectional double tracing. The minimum number of closed walks in a retracting free oriented walk double covering of G is denoted by c(G). The minimum number of retractings in a bidirectional double tracing of G is denoted by r(G). We shall prove that for all connected noncycle graphs G with minimum degree at least 2, r(G) = c(G) − 1. The problem of characterizing those graphs G for which r(G) = 0 was raised by Ore. Thomassen solved this problem by relating it to the existence of certain spanning trees. We generalize this result, and relate the parameters r(G), c(G) to spanning trees of G. This relation yields a polynomial time algorithm to determine the parameters c(G) and r(G). © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 89–102, 1998     

Birefringence and stress-strain diagrams for oriented atactic polymethyl methacrylate and polystyrene films

The stress-strain diagrams of amorphous linear polymers oriented under different conditions are examined; a comparison is made with the parameters of their internal structure. It is shown that the shape of the diagram for rigid polymers is basically determined by the degree of orientation of the links of the macromolecules irrespective of the molecular weight of the polymer and the extension conditions. It is established that the moment of failure can not be determined from this parameter alone. It is found that when the oriented polymer is tested close to the softening point the correlation between the shape of the diagram and the birefringence, characterizing the degree of orientation of the links of the macromolecules, is disturbed.Mekhanika Polimerov, Vol. 2, No. 3, pp. 435–439, 1966     

Quantum deformations of fundamental groups of oriented -manifolds

We compute two-term skein modules of framed oriented links in oriented -manifolds. They contain the self-writhe and total linking number invariants of framed oriented links in a universal way. The relations in a natural presentation of the skein module are interpreted as monodromies in the space of immersions of circles into the -manifold.

     

Model formulations for hub covering problems

Improved model formulations for hub covering problems are proposed. We discuss multiple and single allocation problems, including non-increasing quantity-dependent transport time functions for transport links for the latter case. Computational results are presented, which show that the new solution approaches for problems with quantity-independent transport times clearly outperform previous work on this topic.     

Diffeomorphic vs Isotopic Links in Lens Spaces

Links in lens spaces may be defined to be equivalent by ambient isotopy or by diffeomorphism of pairs. In the first case, for all the combinatorial representations of links, there is a set of Reidemeister-type moves on diagrams connecting isotopy equivalent links. In this paper, we provide a set of moves on disk, band and grid diagrams that connects diffeo-equivalent links: there are up to four isotopy equivalent links in each diffeo-equivalence class. Moreover, we investigate how the diffeo-equivalence relates to the lift of the link in the 3-sphere: in the particular case of oriented primitive-homologous knots, the lift completely determines the knot class in L(p, q) up to diffeo-equivalence, and thus only four possible knots up to isotopy equivalence can have the same lift.     

Notes on braidzel surfaces for links

As a generalization of pretzel surfaces, L. Rudolph has introduced a notion of braidzel surfaces in his study of the quasipositivity for pretzel surfaces. In this paper, we show that any oriented link has a braidzel surface. We also introduce a new geometric numerical invariant of links with respect to their braidzel surface and study relationships among them and other ``genus' for links.

     

Links in a thickened surface

For a given two-dimensional surface μ, we studi invariants for oriented links in μ×[0,1] which generalize the two-variable HOMFLY polynomials when μ is the 2-disk. These invariants are connected to multiparameter quantum groups whose special properties are discussed. Si studiano gli invarianti dei nodi in spazi del tipo μ×[0,1], dove μ è una superficie. Questi invarianti generalizzano gli invarianti di HOMFLY.

---

(Conferenza tenuta dal Prof. P. Cotta-Ramusino il 16 maggio 1991)     

Power and reversal power links for binary regressions: An application for motor insurance policyholders

In binary regression, symmetric links such as logit and probit are usually considered as standard. However, in the presence of unbalancing of ones and zeros, these links can be inappropriate and inflexible to fit the skewness in the response curve and likely to lead to misspecification. This is the case of covering some type of insurance, where it can be observed that the probability of a given binary response variable approaches zero at different rates than it approaches one. Furthermore, when usual links are considered, there is not a skewness parameter associated with the distribution chosen that, regardless of the linear predictor, is easily interpreted. In order to overcome such problems, a proposal for the construction of a set of new skew links is developed in this paper, where some of their properties are discussed. In this context, power links and their reversal versions are presented. A Bayesian inference approach using MCMC is developed for the presented models. The methodology is illustrated considering a sample of motor insurance policyholders selected randomly by gender. Results suggest that the proposed link functions are more appropriate than other alternative link functions commonly used in the literature. Copyright © 2016 John Wiley & Sons, Ltd.     

An invariant of triangulated links from the quantum dilogarithm

An invariant of triangulated links in triangulated three-dimensional manifolds is constructed by means of the cyclic quantum dilogarithm. Apparently, it is an isotopic invariant of nonoriented links in an oriented closed three-dimensional manifold. Bibliography: 13 titles. Dedicated to the memory of V. N. Popov Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 224, 1995, pp. 208–214. Translated by B. Bekker.     

The behavior of invariants of finite degree under interdependent transformations of links

A new approach to the definition of the notion of finite-degree invariants of oriented links is described. It is proved that using new transformations, which are much more general than usual, actually leads to the same theory of such invariants. Applying these general transformations we also prove that the invariants of finite degree are polynomials in the gleams if the Hopf projection of the link is fixed. Bibliography: 3 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 231, 1995, pp. 141–147. Translated by N. Yu. Netsvetaev.     

Constructions of S-lattices

We give a construction of lattices whose covering graphs can be oriented as a graded order with bottom v for any vertex v in the lattice.     

Connected Covering Numbers

A connected covering is a design system in which the corresponding block graph is connected. The minimum size of such coverings are called connected coverings numbers. In this paper, we present various formulas and bounds for several parameter settings for these numbers. We also investigate results in connection with Turán systems. Finally, a new general upper bound, improving an earlier result, is given. The latter is used to improve upper bounds on a question concerning oriented matroid due to Las Vergnas.     

On Rational Knots and Links in the Solid Torus

We introduce the notion of rational links in the solid torus. We show that rational links in the solid torus are fully characterized by rational tangles, and hence by the continued fraction of the rational tangle. Furthermore, we generalize this by giving an infinite family of ambient isotopy invariants of colored diagrams in the Kauffman bracket skein module of an oriented surface.     

Fully Optimal Bases and the Active Bijection in Graphs,Hyperplane Arrangements,and Oriented Matroids

In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective generalizations of some counting formulas. New intrinsic constructions in oriented matroids on a linearly ordered set of elements establish notably structural links between counting regions and linear programming. We introduce fully optimal bases, which have a simple combinatorial characterization, and strengthen the well-known optimal bases of linear programming. Our main result is that every bounded region of an ordered hyperplane arrangement, or ordered oriented matroid, has a unique fully optimal basis, providing the active bijection between bounded regions and uniactive internal bases. The active bijec-tion is extended to an activity preserving mapping between all reorientations and all bases of an ordered oriented matroid. It gives a bijective interpretation of the equality of two expressions for the Tutte polynomial, as well as a new expression of this polynomial in terms of beta invariants of minors. There are several refinements, such as an activity preserving bijection between regions (acyclic reorientations) and no-broken-circuit subsets, and others in terms of hyperplane arrangements, graphs, and permutations.