Related papers: Matrix transposition and braid reversion
Various properties of a class of braid matrices, presented before, are studied considering $N^2 \times N^2 (N=3,4,...)$ vector representations for two subclasses. For $q=1$ the matrices are nontrivial. Triangularity $(\hat R^2 =I)$…
We classify homomorphisms from the braid group on $n$ strands to the pure mapping class group of a nonoriantable surface of genus $g$. For $n\ge 14$ and $g\le 2\lfloor{n/2}\rfloor+1$ every such homomorphism is either cyclic, or it maps…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…
Burau representation of the Artin braid group remains as one of the very important representations for the braid group. Partly, because of its connections to the Alexander polynomial which is one of the first and most useful invariants for…
A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be…
Image matting aims to predict alpha values of elaborate uncertainty areas of natural images, like hairs, smoke, and spider web. However, existing methods perform poorly when faced with highly transparent foreground objects due to the large…
In this paper we derive a representation of an arbitrary real matrix M as the difference of a real matrix A and the transpose of its inverse. This expression may prove useful for progressing beyond known results for which the appearance of…
Extracting robust feature representation is one of the key challenges in object re-identification (ReID). Although convolution neural network (CNN)-based methods have achieved great success, they only process one local neighborhood at a…
An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…
We show that the Lawrence--Krammer representation is unitary. We explicitly present the non-singular matrix representing the sesquilinear pairing invariant under the action. We show that reversing the orientation of a braid is equivalent to…
We develop a theory of localization for braid group representations associated with objects in braided fusion categories and, more generally, to Yang-Baxter operators in monoidal categories. The essential problem is to determine when a…
We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However,…
Symmetric $k$-varieties generalize Riemannian sym\-me\-tric spaces to reductive groups defined over arbitrary fields. For most perfect fields, it is known that symmetric $k$-varieties are in one-to-one correspondence with isomorphy classes…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the $1$-D (one-dimensional) case are classical and have numerous applications. Last year, we considered the $2$-D case of…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
In recent years the use of convolutional layers to encode an inductive bias (translational equivariance) in neural networks has proven to be a very fruitful idea. The successes of this approach have motivated a line of research into…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
In this paper we further develop the theory of $\alpha$-induction for nets of subfactors, in particular in view of the system of sectors obtained by mixing the two kinds of induction arising from the two choices of braiding. We construct a…