Related papers: Linking numbers and boundaries of varieties

Topology describes properties of physical systems that remain constant under continuous deformations. For infinite vector waves, global topological invariants in position space are typically associated with periodic patterns. We demonstrate…

The multiplicity of an algebraic curve $C$ in the complex plane at a point $p$ on that curve is defined as the number of points that occur at the intersection of $C$ with a general complex line that passes close to the point $p$. It is…

Gorenstein liaison seems to be the natural notion to generalize to higher codimension the well-known results about liaison of varieties of codimension~2 in projective space. In this paper we study points in ${\mathbb P}^3$ and curves in…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Let $n,$ $m \geq 2$ be integers, and let $R$ be a subring of $\mathbb R$ with field of fractions $F.$ In this article, we generalize the rational angle bisection problem previously proposed by the author to the following problem: which…

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with $\delta(G)\geq \lfloor\frac{3}{2}k\rfloor+m-1$ contains a subtree…

We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…

The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with…

Given a complex algebraic variety X, we define a natural number called the motivic dimension which measures the amount of transcendental (co)homology of X. It is zero precisely when all the (co)homolgy is spanned by algebraic cycles. Most…

We introduce a new topological invariant, which is a nonnegative integer, of compact manifolds with boundaries associated with a kind of decomposition of them. Let M and N be m-dimensional compact connected manifolds with boundaries. The…

An oriented link is positive if it has a link diagram whose crossings are all positive. An oriented link is almost positive if it is not positive and has a link diagram with exactly one negative crossing. It is known that the Rasmussen…

Convex clustering refers, for given $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^p$, to the minimization of \begin{eqnarray*} u(\gamma) & = & \underset{u_1, \dots, u_n }{\arg\min}\;\sum_{i=1}^{n}{\lVert x_i - u_i \rVert^2} + \gamma…

The linking number is the simplest link invariant given by Gauss; it is the first Gauss diagram formula expressed by one arrow among two circles. Proceeding the next stage, we study the second Gauss diagram formula consisting of two arrows…

We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…

A geometric interpretation of the vanishing of Milnor's higher order linking numbers remains an important open problem in the study of link concordance. In the 1990's, works of Cochran-Orr and Livingston exhibit a potential resolution to…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

Given an $m$-component link $L$ in $S^3$ ($m \ge 2$), we construct a family of links which are link homotopic, but not link isotopic, to $L$. Every proper sublink of such a link is link isotopic to the corresponding sublink of $L$.…

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…