Related papers: On the complexity of braids
Understanding natural phenomenon through the interactions of different complex systems has become an increasing focus in scientific inquiry. Defining complexity and actually measuring it is an ongoing debate and no standard framework has…
Some recently proposed definitions of Jackiw-Teitelboim gravity and supergravities in terms of combinations of minimal string models are explored, with a focus on physics beyond the perturbative expansion in spacetime topology. While this…
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…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…
The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
We study how the length and the twisting parameter of a curve change along a Teichmuller geodesic. We then use our results to provide a formula for the Teichmuller distance between two hyperbolic metrics on a surface, in terms of the…
The paper is devoted to an approach to the notion of the complex dilatation based on the following observations. (1) A natural measure of the distortion of the conformal structure by a real linear automorphism of the complex plane is the…
Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…
Research on the use of information geometry (IG) in modern physics has witnessed significant advances recently. In this review article, we report on the utilization of IG methods to define measures of complexity in both classical and,…
In [V.O. Manturov, Non-reidemeister knot theory and its applications in dynamical systems, geometry, and topology, arxiv:1501.05208] the first named author gave the definition of $k$-free braid groups $G_n^k$. Here we establish connections…
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree…
Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connecting each pair of sampled points independently with a…
We consider mechanically generated molecular braids composed of two molecules where long range interactions between them can be considered to be very weak. We describe a model that takes account of the thermal fluctuations of the braid,…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
In this paper we refine a conjecture relating the time-dependent size of an Einstein-Rosen bridge to the computational complexity of the of the dual quantum state. Our refinement states that the complexity is proportional to the spatial…
We show that Lawrence's representation and linear representations from quantum sl_2 called generic highest weight vectors detect the dual Garside length of braids in a simple and natural way. That is, by expressing a representation as a…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
In this paper, we consider the iterated trimming complex associated to data yielding a complex of length $3$. We compute an explicit algebra structure in this complex in terms of the algebra structures of the associated input data.…