arXiv research

Paper discusses ethical norms for machine learning to prevent misuse.

Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the {\it forbidden number}. We relate the forbidden number to several known invarian…

Forbidden moves categorify fused links into quivers.

We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour moves necessary to transform a diagram of the virtual knot into the trivial knot …

New moves help untangle complex knots.

The existence of forbidden patterns, i.e., certain missing sequences in a given time series, is a recently proposed instrument of potential application in the study of time series. Forbidden patterns are related to the permutation entropy, which has the basic properties of classic chaos indicators, thus allowing to sep…

The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram

Study lens spaces' definite fillings, classifying those with specific inequalities.

The study finds conditions on graph complements for positive curvature.

32 knot projections classified based on forbidden Reidemeister moves.

NTS-NOTEARS learns DBNs from time-series data with prior knowledge.

Recent studies classify the topology of proteins by analysing the distribution of their projections using knotoids. The approximation of this distribution depends on the number of projection directions that are sampled. Here we investigate the relation between knotoids differing only by small perturbations of the direc…

The H(n)-move simplifies virtual and welded knots and links.

The inertia subgroup $I_n(π)$ of a surgery obstruction group $L_n(π)$ is generated by elements which act trivially on the set of homotopy triangulations $\Cal S(X)$ for some closed topological manifold $X^{n-1}$ with $π_1(X)=π$. This group is a subgroup of the group $C_n(π)$ which consists of the elements which can be …

We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin diagrams, as well as a simple classification of alternating positive braid knots.

Let $M$ be a compact irreducible hyperkahler manifold, from Bogomolov inequality [V1] we obtain forbidden values of the second Betti number $b_2$ in arbitrary dimension. UPD: Unfortunately, decomposition of dual to BBF-form is not right in the main theorem. Instead of this work, take a look on recent preprints of Sawon…

The use of Reinforcement Learning (RL) is still restricted to simulation or to enhance human-operated systems through recommendations. Real-world environments (e.g. industrial robots or power grids) are generally designed with safety constraints in mind implemented in the shape of valid actions masks or contingency con…

A virtual doodle is an equivalence class of virtual diagrams under an equivalence relation generated by flat version of classical Reidemesiter moves and virtual Reidemsiter moves such that Reidemeister moves of type 3 are forbidden. In this paper we discuss colorings of virtual diagrams using an algebra, called a doodl…

We show that the difference between the Seifert genus and the topological 4-genus of a prime positive braid knot is bounded from below by an affine function of the minimal number of strands among positive braid representatives of the knot. We deduce that among prime positive braid knots, the property of having such a g…

We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed between any pair of nodes. Specifically, we present local, pairwise and global Marko…

We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group $A(K)$ has such a subgroup if its defining graph $K$ contains an $n$-hole (i.e. an induced cycle of length $n$) with $n\geq 5$. We construct another eight "forbidden" grap…

On an even conformal manifold $(M,c)$, such that the critical GJMS operator has non-trivial kernel, we identify and discuss the role of a finite dimensional vector space $N(Q)$ of functions determined by the conformal structure. Using these we describe an infinite dimensional class of functions that cannot be the Q-cur…

New concepts of barriers and black regions defined for Lorentzian manifolds.

New method uses surrogate outcomes and single-record data to improve suicide risk modeling.

Classifies virtual links up to a specific move.

TSSC images enhance chaotic signal classification using ConvNets.

Bayesian method detects Markov order in network paths more reliably.

In 1996 M. Traizet obtained singly periodic minimal surfaces with Scherk ends of arbitrary genus by desingularizing a set of vertical planes at their intersections. However, in Traizet's work it is not allowed that three or more planes intersect at the same line. In our paper, by a {\it saddle-tower} we call the desing…

Study on unknotting twisted knots using arc shift and region arc shift moves.

We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered local and pairwise Markov properties for the new models. We show the equivalence…

The paper defines and analyzes quandles of knotoids and linkoids.

We study the asymptotic behaviour of the partial density function associated to sections of a positive hermitian line bundle that vanish to a particular order along a fixed divisor $Y$. Assuming the data in question is invariant under an $S^1$-action (locally around $Y$) we prove that this density function has a distri…

Paper constructs representations for virtual braids and flat braids.

We introduce a multivariate Hawkes process with constraints on its conditional density. It is a multivariate point process with conditional intensity similar to that of a multivariate Hawkes process but certain events are forbidden with respect to boundary conditions on a multidimensional constraint variable, whose evo…

This paper classifies minimal fillings of lens spaces.

In order to successfully model Long Distance Dependencies (LDDs) it is necessary to understand the full-range of the characteristics of the LDDs exhibited in a target dataset. In this paper, we use Strictly k-Piecewise languages to generate datasets with various properties. We then compute the characteristics of the LD…

The paper studies strict equivalence in multi-virtual linkoids with new invariants.

Study on virtual singular braid groups with algebraic properties and homomorphisms.

New invariants show stronger virtual knot sets.

Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in $\mathbb{S}^3$. Later Horiuchi and Ohyama defined Gordian complex of virtual knots using $v$-move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…

The paper constructs representations of flat virtual braids by free group automorphisms.

Paper introduces a new power-dominance axis in estimator design.

The presence of Long Distance Dependencies (LDDs) in sequential data poses significant challenges for computational models. Various recurrent neural architectures have been designed to mitigate this issue. In order to test these state-of-the-art architectures, there is growing need for rich benchmarking datasets. Howev…

The paper introduces a new filtration for knot invariants and proves the existence of nontrivial knots.

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study of fair learning under the constraint of differential privacy. We design two lear…

Language models allocate information storage, not collapsing into uniform representations.

LOAD discovers optimal adjustments locally for scalable causal inference.

The study explores spacetimes with changing spatial curvature, leading to topological transitions.