Related papers: On the complexity of braids
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
The problem of detecting and measuring the repetitiveness of one-dimensional strings has been extensively studied in data compression and text indexing. Our understanding of these issues has been significantly improved by the introduction…
A geometric braid $B$ can be interpreted as a loop in the space of monic complex polynomials with distinct roots. This loop defines a function $g:\mathbb{C}\times S^1\to\mathbb{C}$ that vanishes on $B$. We define the set of P-fibered braids…
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
We continue the program of systematic study of extended HOMFLY polynomials. Extended polynomials depend on infinitely many time variables, are close relatives of integrable tau-functions, and depend on the choice of the braid representation…
General braided counterparts of classical Clifford algebras are introduced and investigated. Braided Clifford algebras are defined as Chevalley-Kahler deformations of the corresponding braided exterior algebras. Analogs of the spinor…
Computational asymmetry, i.e., the discrepancy between the complexity of transformations and the complexity of their inverses, is at the core of one-way transformations. We introduce a computational asymmetry function that measures the…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…
We revisit the geometric foundations of mesh representation through the lens of Plane-based Geometric Algebra (PGA), questioning its efficiency and expressiveness for discrete geometry. We find how $k$-simplices (vertices, edges, faces,…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
Consider a binary string $x$ of length $n$ whose Kolmogorov complexity is $\alpha n$ for some $\alpha<1$. We want to increase the complexity of $x$ by changing a small fraction of bits in $x$. This is always possible: Buhrman, Fortnow,…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
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…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
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…
This paper is devoted to present new definition of complexity factor for static cylindrically symmetric matter configurations in $f(R,T,R_{\mu\nu}T^{\mu\nu})$ gravity. For this purpose, we have considered irrotational static cylindrical…
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{\omega+3}a+n^4a^2+n^\omega\log(1/\epsilon))$ time algorithm for finding an…