MixedMath - explorations in math and programing

Learning Möbius from Inconvenient Integer Representations

David Lowry-Duda — Fri, 11 Apr 2025 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

Random numbers in flint aren't random

David Lowry-Duda — Thu, 13 Mar 2025 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

MathShare

David Lowry-Duda — Tue, 25 Feb 2025 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

The Möbius function in python+CPP: basic ctypes

David Lowry-Duda — Wed, 19 Feb 2025 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

My version of arxiv_to_bibtex

David Lowry-Duda — Wed, 05 Feb 2025 03:14:15 +0000

For a long time, when I wanted to cite papers on the arXiv, I would go to arxiv2bibtex.org, enter information, and then get back a some data. This was made by Sven S. Porst, it's free to use (as in beer), and it has its own github repository.

Then one day I wanted to programmatically create bibtex citations based on arxiv URLs. How hard would it be to adapt Sven's code¹ ¹Sven also didn't include a LICENSE file for his repository. I would argue that the intentions are pretty clear. But I would also argue that it's not a very challenging program to rewrite anyway. for my uses?

It turns out that arxiv2bibtex.org does a small amount of processing on the queries. It was written several years ago and has a tiny python script in the background. Unfortunately, this script is intermingled with cgi code that runs the site. I need to do a small amount of work.

I set out to write my program for programmatic construction given lists of arxiv urls. The result is my version of arxiv_to_bibtex, a GPL (but still very simple) program.

The arxiv does a great job at making this as easy as possible. In fact the arxiv now has Export BibTeX Citation buttons on each paper. For example, navigating to this paper and clicking Export BibTeX Citation returns

@misc{lowryduda2025databaserigorousmaassforms,
      title={A database of rigorous Maass forms},
      author={David Lowry-Duda},
      year={2025},
      eprint={2502.01442},
      archivePrefix={arXiv},
      primaryClass={math.NT},
      url={https://arxiv.org/abs/2502.01442},
}

The arxiv is a triumph of modern science.

Further, the arxiv exposes a very convenient API that one can use to construct citations in whatever way you want. There are several obvious things that one wants to do. The bibliographic data is essentially static, but the citation key can be changed. I use the first author name (with a small amount of normalization, e.g. Lowry-Duda becomes lowryduda), then the year, and then the first "not unimportant word" of the title.

I rather like controlling the citation keys. And sometimes I want to get bibtex for a list of papers. And the arxiv API makes this all very simple. So I also wrote a pure javascript implementation² ²The hardest part about the conversion was adding a small amount of rate-limiting to be nice to the arxiv. and made it available on my site.

Go forth and use it! Or take it (all the code is GPL and trivial) and modify it to do what you really want it to do. I will continue to use it and thus appear to have superpowers occasionally.

Slides from a talk at the last Simons Annual Meeting

David Lowry-Duda — Wed, 15 Jan 2025 03:14:15 +0000

Today I'm giving a talk at the last annual meeting¹ ¹It's the 8th of our 7 annual meetings of the Simons Collaboration on Arithmetic Geometry, Number Theory, and Computation. It's about Maass forms.

The short of it is: Maass forms are in the LMFDB now, go check it out! I've given many other talks about Maass forms in the past, and I'm happy to talk more about them.

The slides for my talk are here.

An (updated) brief note on cryptography

David Lowry-Duda — Mon, 30 Dec 2024 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

Paper: The Fibonacci Zeta Function and Continuation

David Lowry-Duda — Wed, 18 Dec 2024 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

Odd Fibonacci Zeta Function

David Lowry-Duda — Wed, 04 Dec 2024 03:14:15 +0000

This post is larger than 10000 bytes, which is above the limit for this RSS feed. Perhaps it is long or has embedded images or code. Please view it directly at the url.

Slides from a talk at LSU on Murmuration phenoma in number theory

David Lowry-Duda — Tue, 19 Nov 2024 03:14:15 +0000

I'm giving a talk at LSU on murmurations in number theory, and to a lesser extent about machine learning in number theory.

The slides for my talk are here. I do some relatively fancy (for me) slide shennanigans, so there is no handout form available.

This is closely related to

My paper BBLLD23 on murmurations of modular forms of fixed level and increasing weight.
My paper BLLDSHZ24 on murmurations of Maass forms of fixed level and weight and increasing eigenvalue.
This discussion page on modular murmurations.
This experimental description page on Maass murmurations.
My talk from last week, which is in some sense a sequel to this talk.

See also Quanta's article on murmurations.