<div dir="ltr"><div class="gmail_default" style="font-family:times new roman,serif">Could this be helpful?</div><div class="gmail_default" style="font-family:times new roman,serif"><br></div><div class="gmail_default" style="font-family:times new roman,serif"><a href="http://data-mining.philippe-fournier-viger.com/drawing-powerset-set-using-java-graphviz-hasse-diagram/">http://data-mining.philippe-fournier-viger.com/drawing-powerset-set-using-java-graphviz-hasse-diagram/</a></div><div class="gmail_default" style="font-family:times new roman,serif"><br></div><div class="gmail_default" style="font-family:times new roman,serif">Uwe<br></div></div><div class="gmail_extra"><br><div class="gmail_quote">2017-08-29 2:58 GMT+02:00 Daniel Greenhoe <span dir="ltr"><<a href="mailto:dgreenhoe@gmail.com" target="_blank">dgreenhoe@gmail.com</a>></span>:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Does anyone know of any software for the generation, outputing LaTeX<br>
syntax, of Hasse diagrams for lattices (from order theory/lattice<br>
theory)?<br>
<br>
The number of unlabeled lattices over sets with n=1,2,3,... elements is<br>
  1, 1, 1, 1, 2, 5, 15, 53, 222, 1078, 5994, ... , respectively<br>
(reference: <a href="http://oeis.org/A006966" rel="noreferrer" target="_blank">http://oeis.org/A006966</a>).<br>
<br>
An algorithm for such a generator is apparently described in Kyuno's<br>
1979 paper: <a href="https://doi.org/10.1090/S0025-5718-1979-0514837-9" rel="noreferrer" target="_blank">https://doi.org/10.1090/S0025-<wbr>5718-1979-0514837-9</a><br>
<br>
I have generated LaTeX source files for Hasse diagrams of unlabeled<br>
lattices orders 1--7 and uploaded them to github along with some<br>
documentation (pdf file): <a href="https://github.com/dgreenhoe/hasse" rel="noreferrer" target="_blank">https://github.com/dgreenhoe/<wbr>hasse</a><br>
<br>
If anyone has order 8 (222 lattices) or higher source already written,<br>
maybe consider uploading the source files to github?<br>
______________________________<wbr>_________________<br>
TeX FAQ: <a href="http://www.tex.ac.uk/faq" rel="noreferrer" target="_blank">http://www.tex.ac.uk/faq</a><br>
Mailing list archives: <a href="http://tug.org/pipermail/texhax/" rel="noreferrer" target="_blank">http://tug.org/pipermail/<wbr>texhax/</a><br>
More links: <a href="http://tug.org/begin.html" rel="noreferrer" target="_blank">http://tug.org/begin.html</a><br>
<br>
Automated subscription management: <a href="http://tug.org/mailman/listinfo/texhax" rel="noreferrer" target="_blank">http://tug.org/mailman/<wbr>listinfo/texhax</a><br>
Human mailing list managers: <a href="mailto:postmaster@tug.org">postmaster@tug.org</a><br>
</blockquote></div><br><br clear="all"><br>-- <br><div class="gmail_signature" data-smartmail="gmail_signature">Dr. Uwe Ziegenhagen<br><<a href="http://www.uweziegenhagen.de" target="_blank">http://www.uweziegenhagen.de</a>></div>
</div>