Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Kolmogorov Complexity of Random Very Long Braided Words   Any positive word comprised of random sequence of tokens form a finite
alphabet can be reduced (without change of length) using an appropriate size
Braid group relationships. Surprisingly the Braid relations dramatically reduce
the Kolmogorov Complexity of the original random word and do so in distinct
bands of (rate of change) values with gaps in between. Distribution of these
bands are estimated and empirical statistics collected by actually coding
approximations to the Kolmogorov Complexity (in Mathematica 9.0).
Lempel-Ziv-Welch lossless compression algorithm techniques used to estimate the
distribution for gaped bands. Evidence provided that such distributions of
reduction in Kolmogorov Complexity based upon Braid groups are universal i.e.
they can model more general algebraic structures other than Braid groups.

26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
28
The categories of this paper are: alg-geom