{"id":269,"date":"2021-01-17T18:26:50","date_gmt":"2021-01-17T18:26:50","guid":{"rendered":"https:\/\/mathlab.io\/?page_id=269"},"modified":"2026-03-24T20:35:04","modified_gmt":"2026-03-24T20:35:04","slug":"code","status":"publish","type":"page","link":"https:\/\/automathon.org\/index.php\/code\/","title":{"rendered":"Code"},"content":{"rendered":"\n

<\/p>\n\n\n\n

I frequently write Python\/SageMath code when conducting research. There’s a slight possibility that it might be useful or interesting to another couple of people in the world, so I am sharing git repositories with some of my Jupyter notebooks.<\/p>\n\n\n\n

Unicyclic graphs<\/h2>\n\n\n\n

Here’s code<\/a> that allowed me to find the first example of unicyclic bipartite graphs with the same chromatic symmetric function, written mostly while our group<\/a> was in residence at the AMS MRC in June 2024. SageMath didn’t have a unicyclic graph generator, so most of the code works to build all of them of prescribed order (and cycle size).<\/p>\n\n\n\n

Kronecker coefficients and column-row polytopes<\/strong><\/h2>\n\n\n\n

Here is code<\/a> that constructs the inequalities defining the “column-row” polytope described in this article by S\u00e1nchez-Vallejo<\/a>, and then uses LattE in enumerate the integer points and compute Kronecker coefficients. It was useful for work on the (p,q,2)-case with Vallejo (forthcoming).<\/p>\n\n\n\n

Kazhdan-Lusztig polynomials<\/h2>\n\n\n\n

Here is code<\/a> we used for the “Kazhdan-Lusztig polynomials for \"\tilde{B}_2\"” article<\/a>. It was helpful for finding some of the explicit formulas for elements in the affine Weyl group.<\/p>\n\n\n\n

Ternary factorization<\/h2>\n\n\n\n

Here is an implementation<\/a> of the algorithm of Theorem 4.6 from my ternary arithmetic article<\/a>. The basic idea is essentially what is sometimes called “Kraitchik’s method<\/a>.”<\/p>\n\n\n\n

<\/p>\n\n\n\n

(more coming soon — feel free to reach out with requests)<\/p>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

I frequently write Python\/SageMath code when conducting research. There’s a slight possibility that it might be useful or interesting to another couple of people in the world, so I am sharing git repositories with some of my Jupyter notebooks. Unicyclic graphs Here’s code that allowed me to find the first example of unicyclic bipartite graphsRead more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-269","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/pages\/269","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/comments?post=269"}],"version-history":[{"count":8,"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/pages\/269\/revisions"}],"predecessor-version":[{"id":520,"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/pages\/269\/revisions\/520"}],"wp:attachment":[{"href":"https:\/\/automathon.org\/index.php\/wp-json\/wp\/v2\/media?parent=269"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}