Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs   We present a new $O(k^2 \binom{n}{k}^2)$ method for generating an orthogonal
basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods
for computing a full eigenbasis of sparse symmetric matrices, the algorithm
presented here is non-iterative, and produces exact results under an
infinite-precision computation model. In addition, our method is highly
parallelizable; given access to unlimited parallel processors, the eigenbasis
can be constructed in only $O(n)$ time given n and k. We also present an
algorithm for computing projections onto the eigenspaces of $J(n,k)$ in
parallel time $O(n)$.

0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
2
The categories of this paper are: math
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph