Related papers: An algorithm to calculate generalized Seifert matr…

We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…

We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…

In deep learning inference, model parameters are pruned and quantized to reduce the model size. Compression methods and common subexpression (CSE) elimination algorithms are applied on sparse constant matrices to deploy the models on…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then…

We classify the indexed links corresponding to the union of the closed orbits of non-singular Morse-Smale flows on most graph manifolds. We find that each of this kind of indexed links can be obtained by applying a finite steps of…

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.

Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a graph $G$, and the objective is to determine whether $G\models \psi$. Our main theorem states that…

We propose new provable practical deterministic polynomial time algorithm for the braid Wang, Xu, Li, Lin and Wang Double shielded public key cryptosystems. We show that a linear decomposition attack based on the decomposition method…

We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a…

The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…

We use generalized Taylor formulae in order to give some simple constructions in the real closure of an \ovfz. We deduce a new, simple quantifier elimination algorithm for \rcvfs and some theorems about constructible subsets of real…

By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of $p$-level…

We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…

We define the Witt coindex of a link with non-trivial Alexander polynomial, as a concordance invariant from the Seifert form. We show that it provides an upper bound for the (locally flat) slice Euler characteristic of the link, extending…

Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…

This study deals with the missing link prediction problem: the problem of predicting the existence of missing connections between entities of interest. We address link prediction using coupled analysis of relational datasets represented as…