I'm excited to share: we built a free AI coach for intro-level proof writing. It critiques drafts, points out gaps, and helps you or your students iterate without giving away the answer. Also for lapsed mathematicians to see if they've still got it. Link in the next tweet.
Over 15 years ago, I wrote a blog post with some formulas involving maximal self-avoiding walks (https://t.co/IwXzqVoCqj). At the end of last month, @jpantone et al posted a paper that improves upon those results in ridiculously impressive ways (https://t.co/UnV4LNInCw).
Thanks to @markmcan’s support with Charity Engine, it’s now known that the longest string of digits 1-6, such that only 121 of the digits fail to add a substring comprising a new permutation, is 643 digits long.
For 122, 648 is shown, 649 to be ruled out.
https://t.co/v1nHKZBoRt
My submission for #ThisWeeksRiddler at @FiveThirtyEight. @jpantone and I found there are 322 ways to finish the race in the shortest possible time (12 moves). I went easy on @xaqwg and submitted only this one. It travels the shortest Euclidean distance (not that that matters).
26th International Conference on Applications of Computer Algebra is online and it is free. It will start this Friday. I suggest at the very least checking the program, and the book of abstracts: https://t.co/e5taBnyYUQ
Watch #math talks instead of YouTube over this weekend. 😛
Our sysadmin just confirmed that the upgrade was successful. About 60 clients disconnected while the server was unreachable. Those clients should have no trouble reconnecting now. The search continues!
A message from Jay Pantone: On Thu 27 Feb, around 15:00 GMT, the https://t.co/j4esFGdtvV server will be briefly down while Marquette's IT department installs new networking hardware. Depending on how long that downtime lasts, some clients may disconnect and need to be restarted.
A message from Jay Pantone: On Thu 27 Feb, around 15:00 GMT, the https://t.co/j4esFGdtvV server will be briefly down while Marquette's IT department installs new networking hardware. Depending on how long that downtime lasts, some clients may disconnect and need to be restarted.
AMS Special Session on Analytic and Probabilistic Combinatorics, organized by Miklós Bóna, @UF and Jay Pantone @jpantone, @MarquetteU, https://t.co/UbkVYO5d5v #JMM2020
FastDCM is a client for the Distributed Chaffin Method search that uses the GPU rather than the CPU for its calculations. Depending on the precise specifications of your system, it might run several times faster than one instance of the single-CPU client.
https://t.co/5IIUGHwVh3
Please consider signing this petition, which asks the Computer and Information Sciences department at the University of Strathclyde to reconsider their plan to eliminate their Combinatorics group and fire its faculty members.
@aeliasen@gregeganSF That's correct! We just finished the computation for w=116 and started the one for w=117. Each new computation is started with 1 task. Whoever gets it breaks it up into subtasks, then those break up further, etc. There should be plenty of work in an hour or two.