Data

Catalogue of unlabelled lattices on up to 16 elements

Western Sydney University
Gebhardt, Volker ; Tawn, Stephen
Viewed: [[ro.stat.viewed]] Cited: [[ro.stat.cited]] Accessed: [[ro.stat.accessed]]
ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2FANDS&rft_id=https://research-data.westernsydney.edu.au/published/ff5d9c10519311ecb15399911543e199&rft.title=Catalogue of unlabelled lattices on up to 16 elements&rft.identifier=https://research-data.westernsydney.edu.au/published/ff5d9c10519311ecb15399911543e199&rft.publisher=Western Sydney University&rft.description=The catalogue files are plain text files  (The larger files are xz-packed).  The catalogue file unlabelled-N.cats contains representatives of the isomorphism classes of unlabelled lattices with N elements, with each line encoding one lattice. Lines are terminated with '\n' = 0x0a.Each line of a file encodes one lattice as follows:The elements of the lattice are labelled 1,..,N ; where 1 is the upper bound and N is the lower bound of the lattice.The chosen representatives are levellised, that is, if A covers B (where 1 ≤ A,B ≤ N), then A < B holds.  Thus, the incidence matrix describing the covering relation is upper triangular.The line encoding a lattice gives the incidence matrix for the covering relation of the lattice in column major order: For 1 ≤ A < B ≤ N, the ((B-1)*(B-2)/2+A)-th character of the line indicates whether A covers B; the character is '1' if A covers B; the character is '.' otherwise.The lines in each file are sorted lexicographically.Please cite the following forthcoming paper when using data from this catalogue: V. Gebhardt, S. Tawn: Constructing unlabelled lattices, Journal of Algebra, to appear (due in 2019).&rft.creator=Gebhardt, Volker &rft.creator=Tawn, Stephen &rft.date=2018&rft.relation=http://hdl.handle.net/1959.7/uws:50893&rft.coverage=&rft_rights=n/a&rft_rights=CC BY-NC-SA: Attribution-Noncommercial-Share Alike 3.0 AU http://creativecommons.org/licenses/by-nc-sa/3.0/au&rft_subject=Unlabelled lattice&rft.type=dataset&rft.language=English Access the data

Licence & Rights:

Non-Commercial Licence view details
CC-BY-NC-SA

CC BY-NC-SA: Attribution-Noncommercial-Share Alike 3.0 AU
http://creativecommons.org/licenses/by-nc-sa/3.0/au

n/a

Access:

Open view details

Open

Contact Information



Full description

The catalogue files are plain text files  (The larger files are xz-packed).  The catalogue file unlabelled-N.cats contains representatives of the isomorphism classes of unlabelled lattices with N elements, with each line encoding one lattice. Lines are terminated with '\n' = 0x0a.

Each line of a file encodes one lattice as follows:

  • The elements of the lattice are labelled 1,..,N ; where 1 is the upper bound and N is the lower bound of the lattice.

  • The chosen representatives are levellised, that is, if A covers B (where 1 ≤ A,B ≤ N), then A < B holds.  Thus, the incidence matrix describing the covering relation is upper triangular.

  • The line encoding a lattice gives the incidence matrix for the covering relation of the lattice in column major order: For 1 ≤ A < B ≤ N, the ((B-1)*(B-2)/2+A)-th character of the line indicates whether A covers B; the character is '1' if A covers B; the character is '.' otherwise.

  • The lines in each file are sorted lexicographically.

Please cite the following forthcoming paper when using data from this catalogue: V. Gebhardt, S. Tawn: Constructing unlabelled lattices, Journal of Algebra, to appear (due in 2019).

Created: 2018-09-27

Subjects

User Contributed Tags    

Login to tag this record with meaningful keywords to make it easier to discover

Identifiers
  • Local : research-data.westernsydney.edu.au/published/ff5d9c10519311ecb15399911543e199