Related papers: On the complexity of braids
The normalized substring complexity $\delta$ of a string is defined as $\max_k \{c[k]/k\}$, where $c[k]$ is the number of \textit{distinct} substrings of length $k$. This simply defined measure has recently attracted attention due to its…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…
We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…
Braid varieties parametrize linear configurations of flags with transversality conditions dictated by positive braids. They include and generalize reduced double Bruhat cells, positroid varieties, open Bott-Samelson varieties, and…
It is shown how derived brackets naturally arise in sigma-models via Poisson- or antibracket, generalizing a recent observation by Alekseev and Strobl. On the way to a precise formulation of this relation, an explicit coordinate expression…
We propose a new approach to the problem of neural network expressivity, which seeks to characterize how structural properties of a neural network family affect the functions it is able to compute. Our approach is based on an interrelated…
We construct $(2n)^2\times (2n)^2$ unitary braid matrices $\hat{R}$ for $n\geq 2$ generalizing the class known for $n=1$. A set of $(2n)\times (2n)$ matrices $(I,J,K,L)$ are defined. $\hat{R}$ is expressed in terms of their tensor products…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the…
Given an ideal triangulation of a connected 3-manifold with non-empty boundary consisting of a disjoint union of tori, a point of the deformation variety is an assignment of complex numbers to the dihedral angles of the tetrahedra subject…
The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in…
A regularization procedure, that allows one to relate singularities of curvature to those of the Einstein tensor without some of the shortcomings of previous approaches, is proposed. This regularization is obtained by requiring that (i) the…
We study the graded geometric point of view of curvature and torsion of Q-manifolds (differential graded manifolds). In particular, we get a natural graded geometric definition of Courant algebroid curvature and torsion, which correctly…
The volume of data that will be produced by the next generation of astrophysical instruments represents a significant opportunity for making unplanned and unexpected discoveries. Conversely, finding unexpected objects or phenomena within…
In this paper, we study linear convolutional networks with one-dimensional filters and arbitrary strides. The neuromanifold of such a network is a semialgebraic set, represented by a space of polynomials admitting specific factorizations.…
We develop an algorithm for i) computing generalized regular $k$-point grids, ii) reducing the grids to their symmetrically distinct points, and iii) mapping the reduced grid points into the Brillouin zone. The algorithm exploits the…