相关论文: On the complexity of braids

We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…

We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…

It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…

We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…

A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…

The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of complexes (algebras) are introduced. Cohomological range leads to the concepts of derived bounded algebras and…

We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

We examine the interplay of symmetry and topological order in $2+1$ dimensional topological phases of matter. We present a definition of the \it topological symmetry \rm group, which characterizes the symmetry of the emergent topological…

1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the…

Recent developments in the theory of stability conditions and its relation to Teichmuller theory have revealed a deep connection between triangulated categories and surfaces. Motivated by this, we prove a categorical analogue of the…

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

We define a new homotopy algebraic structure, that we call a braided $L_\infty$-algebra, and use it to systematically construct a new class of noncommutative field theories, that we call braided field theories. Braided field theories have…

Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…

Given a connected graph $G=(V,E)$, a set $S\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\in V$, there exist at least $k$ vertices $w_1,...,w_k\in S$ such that $d_G(u,w_i)\ne d_G(v,w_i)$ for every…