Related papers: Basket, flat plumbing and flat plumbing basket num…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…
We show that two hypersurfaces in a manifold are related by a sequence of embedded cobordisms if and only if they represent the same homology class. By applying handle decompositions we turn these cobordisms into a sequence of embedded…
In this paper, a hub refers to a non-terminal vertex of degree at least three. We study the minimum number of hubs needed in a network to guarantee certain flow demand constraints imposed between multiple pairs of sources and sinks. We…
We construct a Seifert surface for a given null-homologous transverse link in a contact manifold that is compatible with a planar open book decomposition, then obtain a formula of the self-linking number. It extends Bennequin's self-linking…
We propose a method to compute complex volume of 2-bridge link complements. Our construction sheds light on a relationship between cluster variables with coefficients and canonical decompositions of link complements.
The parallel linear transports defined by flat linear connection are axiomatically described. On this basis a number of properties, some of which are new, of these transports and connections are derived.
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…
The main result of this paper is a new classification theorem for links (smooth embeddings in codimension 2). The classifying space is the rack space (defined in [Trunks and classifying spaces, Applied Categorical Structures, 3 (1995)…
In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…
We explain how to use bordered algebras to compute a version of link Floer homology. As a corollary, we also give a fast computation of the Thuston polytope for links in the three-sphere.
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…
Laundry surfaces for closed braid diagrams are presented. It is shown that braid diagrams are characterized by linking matrices obtained by lifting cycles from these surfaces. Oriented link types are then characterized by equivalence…
Linking numbers in higher dimensions and their generalization including gauge fields are studied in the context of BF theories. The linking numbers associated to $n$-manifolds with smooth flows generated by divergence-free p-vector fields,…
It is well known that the Blanchfield pairing of a knot can be expressed using Seifert matrices. In this paper, we compute the Blanchfield pairing of a colored link with non-zero Alexander polynomial. More precisely, we show that the…
We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…
We explore a family of invariants obtained from linking numbers. This is a family of Kauffman finite type invariants.