相关论文: On the complexity of braids

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.…

How to measure the complexity of a finite set of vectors embedded in a multidimensional space? This is a non-trivial question which can be approached in many different ways. Here we suggest a set of data complexity measures using universal…

We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a…

Recently, it has been argued in [1] that Jackiw-Teitelboim (JT) gravity can be naturally realized in the Karch-Randall braneworld in $(2+1)$ dimensions. Using the `complexity=volume' proposal, we studied this model and computed the…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

We present a general construction of a geometric notion of circuit complexity for Gaussian states (both bosonic and fermionic) in terms of Riemannian geometry. We lay out general conditions that a Riemannian metric function on the space of…

Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…

Nielsen's geometric approach offers a powerful framework for quantifying the complexity of unitary transformations. In this formulation, complexity is defined as the length of the minimal geodesic in a suitably constructed geometric space…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

Path algebras are a convenient way of describing decompositions of tensor powers of an object in a tensor category. If the category is braided, one obtains representations of the braid groups $B_n$ for all $n\in \N$. We say that such…

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in…

This paper gives a new, simplified presentation of the classical pure braid group. The generators are given by the squares of the longest elements over connected subgraphs, and we prove that the only relations are either commutators or…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We introduce the notion of a braided algebra and study some examples of these. In particular, R-symmetric and R-skew-symmetric algebras of a linear space V equipped with a skew-invertible Hecke symmetry R are braided algebras. We prove the…

It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees…

We consider a certain modification of the group $G^3_n$ which describes dynamics of point configurations, in particular braids, and define a representation of the modified $G^3_n$. The braid representation induced is powerful enough to…

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…