Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Constructing unlabelled lattices   We present an improved orderly algorithm for constructing all unlabelled
lattices up to a given size, that is, an algorithm that constructs the minimal
element of each isomorphism class relative to some total order.
  Our algorithm employs a stabiliser chain approach for cutting branches of the
search space that cannot contain a minimal lattice; to make this work, we grow
lattices by adding a new layer at a time, as opposed to adding one new element
at a time, and we use a total order that is compatible with this modified
strategy.
  The gain in speed is between one and two orders of magnitude. As an
application, we compute the number of unlabelled lattices on 20 elements.

26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn