相关论文: The Relaxation Normal Form of Braids is Regular
We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, including the Lawrence-Bigelow representations of the classical braid groups. These representations naturally…
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…
A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed…
We introduce the family of graphical Hermite simplices and study the Smith normal forms of their matrices of vertex vectors, which is equivalent to studying the group structure of the cokernels for these matrices. Our motivation is to study…
Some curious structural similarities between a recent braid- and Hurwitz algebraic description of the unbroken internal symmetries for a single generations of Standard Model fermions were recently identified. The non-trivial braid groups…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
We discuss how the presence of a suitable symmetry can guarantee the perturbative linearizability of a dynamical system - or a parameter dependent family - via the Poincar\'e Normal Form approach. We discuss this at first formally, and…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
In this article, we study subword complexity of colorings of regular trees. We characterize colorings of bounded subword complexity and study Sturmian colorings, which are colorings of minimal unbounded subword complexity. We classify…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…
In this paper we present some linear algebra behind quadratic parts of quadratically flat complex points of codimension two real submanifold in a complex manifold. Assuming some extra nondegenericity and using the result of Hong, complete…
We describe presentations of braid groups of type $A$ arising from coloured quivers of mutation type $A$. We show that these can be interpreted geometrically as generalised triangulations of regular polygons.
We give a general procedure that provides, given any particular pretzel link, a braid whose closure is the pretzel link. Moreover, we manage to give a specific braid word in terms of the entries of the pretzel link.
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…
Sequential lateration is a class of methods for multidimensional scaling where a suitable subset of nodes is first embedded by some method, e.g., a clique embedded by classical scaling, and then the remaining nodes are recursively embedded…