arXiv research

Study minimizes crossing points of up to 12 curves on a genus 2 surface.

Paper classifies symmetries of cross caps using invariants.

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from the plane curve as states to take the sum of the warping crossing polynomials for…

New method detects changes by maximizing cross-entropy, outperforming existing techniques.

Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We give a set of diagrammatic moves on triple-crossing diagrams analogous to the Re…

Study curvature and torsion from cross-ratios in discrete curves.

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

Cross-validation pitfalls in change-point regression are addressed with new approaches.

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the crossing. In this paper we find a relationship between the triple crossing number and th…

New formula for rotation number without needing a base point.

TimeCNN improves forecasting by refining cross-variable interactions over time.

Table of symmetric diagrams for knots up to 10 crossings.

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of `feature spanning points' can be used for learning. The main potential of cross-kernels lies in the fact that (a) only one side of the matrix scales with the number of data points, and (b) cross-kernels, as oppos…

The paper explores when specific knot operations simplify diagrams.

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the crossing. In this paper we generalize ideas in traditional braid theory to multi-…

A closed Riemannian manifold is said to have cross blocking if whenever distinct points p and q are at distance less than the diameter, all light rays from p can be shaded away from q with at most two point shades. Similarly, a closed Riemannian manifold is said to have sphere blocking if for each point p, all the ligh…

New method for estimating lead-lag times between non-synchronously observed point processes.

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound on the span of the bracket polynomial of K as 4c_2(K), to the n-crossing number:…

For every finite collection of curves on a surface, we define an associated (semi-)norm on the first homology group of the surface. The unit ball of the dual norm is the convex hull of its integer points. We give an interpretation of these points in terms of certain coorientations of the original collection of curves. …

Paper introduces statistical learning for point processes.

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the table of known knots and links with triple-crossing number equal to five. By intro…

We define a family of four-point invariants for Shilov boundaries of bounded symmetric domains of tube type, which generalizes the classical four-point cross ratio on the unit circle. This generalization, which is based on a similar construction of Clerc and Ørsted, is functorial and well-behaved under products; these …

The paper studies how the crossing number of graphs changes with a specific transformation called ΔY-move.

Integrable dynamics explained via geometric maps and cluster algebras.

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An übercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there are no loops nested within others. The übercrossing number, $\text{ü}(K)$, is the…

The study finds lower bounds for the warping degree of a knot projection.

Paper introduces efficient methods for estimating cross-partial derivatives and sensitivity indices.

PPL improves on Takacs-Fiksel estimation for Gibbs models.

This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the Kauffman bracket skein module is a linear combination of $O(2^g)$ basis elements, with…

In this article, we derive concentration inequalities for the cross-validation estimate of the generalization error for empirical risk minimizers. In the general setting, we prove sanity-check bounds in the spirit of \cite{KR99} \textquotedblleft\textit{bounds showing that the worst-case error of this estimate is not m…

The wall-crossing formula for Donaldson invariants of smooth, simply connected four manifolds with $b^+=1$ is shown to be a topological invariant of the manifold for reducible connections with two or fewer singular points. The explicit formulas derived agree with those of Ellingsrud and Gottische and Friedman and Qin f…

The paper examines bounds for stop-loss payoffs using transformed random variables.

We introduce a new test for detection of power-law cross-correlations among a pair of time series - the rescaled covariance test. The test is based on a power-law divergence of the covariance of the partial sums of the long-range cross-correlated processes. Utilizing a heteroskedasticity and auto-correlation robust est…

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes over at that point. A pseudodiagram is a knot diagram that may be missing crossing…

New bounds on odd multicrossing numbers of knots and links are established.

A new method controls risk for set predictors using cross-validation.

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component virtual link diagram $D$, a new virtual link diagram $D(m_{1},\ldots,m_{n})$ is ob…

A new knot invariant measures crossings in three orthogonal directions.

Adaptive importance sampling for estimating point process statistics.

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface with any genus and number of boundary components. If only bigons are allowed, t…

We show that the singularities of spacelike maximal surfaces in Lorentz-Minkowski 3-space generically consist of cuspidal edges, swallowtails and cuspidal cross caps. The same result holds for spacelike mean curvature one surfaces in de Sitter 3-space. To prove these, we shall give a simple criterion for a given singul…

Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an übercrossing projection, a knot projection with a single n-crossing. Such a projection is necessarily composed of a collect…

Algorithm improves blockchain bridge efficiency.

Let $L$ be a fixed link. Given a link diagram $D$, is there a sequence of crossing exchanges and smoothings on $D$ that yields a diagram of $L$? We approach this problem from the computational complexity point of view. It follows from work by Endo, Itoh, and Taniyama that if $L$ is a prime link with crossing number at …

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic immersion of a singular link in $R^{2}$. We tackle this problem by the so-called…

The paper defines new homotopy relations on knot projections and classifies certain knot types.

New methods estimate point-wise dependency from neural MI models.

We prove that if $L$ is a non-trivial alternating link embedded (without crossings) in a closed surface $F\subset S^3$, then $F$ has a compressing disk whose boundary intersects $L$ in no more than two points. Moreover, whenever the surface is incompressible and $\partial$-incompressible in the link exterior, it can be…