Related papers: Matrix transposition and braid reversion
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
We study matrix identities involving multiplication and unary operations such as transposition or Moore-Penrose inversion. We prove that in many cases such identities admit no finite basis.
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
In this short note, we classify the degree-inverting involution on the full square and triangular matrices.
We present a consistent definition for braided ribbon networks in 3-dimensional manifolds, unifying both three and four valent networks in a single framework. We present evolution moves for these networks which are dual to the Pachner moves…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.
The synthesis of string transformation programs from input-output examples utilizes various techniques, all based on an inductive bias that comprises a restricted set of basic operators to be combined. A new algorithm, Transduce, is…
In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…
We associate to every positive braid a braid monodromy group, generalizing the geometric monodromy group of an isolated plane curve singularity. If the closure of the braid is a knot, we identify the corresponding group with a framed…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
Group theory has been used in machine learning to provide a theoretically grounded approach for incorporating known symmetry transformations in tasks from robotics to protein modeling. In these applications, equivariant neural networks use…
The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…
The crossing matrix of a braid on $N$ strands is the $N\times N$ integer matrix with zero diagonal whose $i,j$ entry is the algebraic number (positive minus negative) of crossings by strand $i$ over strand $j$ . When restricted to the…
A closed braid naturally gives rise to a transverse link in the standard contact 3-space. We study the effect of the dynamical properties of the braid monodromy, such as right-veering, on the contact-topological properties of the transverse…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
How can we effectively find the best structures in tree models? Tree models have been favored over complex black box models in domains where interpretability is crucial for making irreversible decisions. However, searching for a tree…
Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be…