BibTeX
CSL-JSON
MLA
Harvard
401 and beyond: improved bounds and algorithms for the Ramsey algebra
search
release_3urhfqluyffvblh2hyvlkywkoi
by
Jeremy F. Alm
Released
as a article
.
2017
Abstract
In this paper, we discuss an improvement of an algorithm to search for primes
p and coset-partitions of Z/pZ* that yield Ramsey algebras over Z/pZ. We also
prove an upper bound on the modulus p in terms of the number of cosets. We
have, as a corollary, that there is no prime p for which there exists a
partition of Z/pZ* into 13 cosets that yields a 13-color Ramsey algebra. Thus
A263308(13) = 0.
In text/plain
format
Archived Files and Locations
application/pdf 218.9 kB
file_fo6fbttpnzbjlo6yrrfkx56nsy
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1609.01817v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links