Related papers: Matrix transposition and braid reversion

Can an $\mathbb{R}^n\rightarrow \mathbb{R}^n$ feedforward network learn matrix-vector multiplication? This study introduces two mechanisms - flexible masking to take matrix inputs, and a unique network pruning to respect the mask's…

We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…

This paper is a continuation of our 2005 paper on complex topology and its implication on invertibility (or non-invertibility). In this paper, we will try to classify the complexity of inversion into 3 different classes. We will use…

Convolutional neural networks have been extremely successful in the image recognition domain because they ensure equivariance to translations. There have been many recent attempts to generalize this framework to other domains, including…

Matrix inversion problems are often encountered in experimental physics, and in particular in high-energy particle physics, under the name of unfolding. The true spectrum of a physical quantity is deformed by the presence of a detector,…

Starting from considering deeper relationship between conjugacy classes and irreducible representations of a finite group $G$, we find some quite simple $R-$matrice defined by using finite groups. This construction produces many sets (or…

This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…

We propose an end-to-end deep learning learning model for graph classification and representation learning that is invariant to permutation of the nodes of the input graphs. We address the challenge of learning a fixed size graph…

An answer to the question investigated in this paper brings a new characterization of internal groupoids such that: (a) it holds even when finite limits are not assumed to exist; (b) it is a full subcategory of the category of…

We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and…

Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix…

In this paper we classify, up to isomorphism, the superinvolutions on algebras of upper block-triangular matrices over an algebraically closed field of characteristic different from $2$.

This paper aims to determine the images of the braid group under representations afforded by the Yang Baxter equation when the solution is a nontrivial $4 \times 4$ matrix. Making the assumption that all the eigenvalues of the Yang Baxter…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

We study compactifications of Matrix theory on twisted tori and non-commutative versions of them. As a first step, we review the construction of multidimensional twisted tori realized as nilmanifolds based on certain nilpotent Lie algebras.…

Let M be a compact, connected surface, possibly with a finite set of points removed from its interior. Let d,n be positive integers, and let N be a d-fold covering space of M. We show that the covering map induces an embedding of the n-th…

Phylogenetic networks provide a means of describing the evolutionary history of sets of species believed to have undergone hybridization or gene flow during their evolution. The mutation process for a set of such species can be modeled as a…

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

We use the notion of isomorphism between two invariant vector fields to shed new light on the issue of linearization of an invariant vector field near a relative equilibrium. We argue that the notion is useful in understanding the passage…