Image may be NSFW.
Clik here to view.

Fun with Algorithms 

FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that are “fun”  but also original and scientifically solid. “Fun”  can be defined in many  ways:  we think of fun results as being amusing or entertaining by their display of  elegance, simplicity, surprise, originality, or wit.  The topics of interest include all aspects of algorithm design and analysis under any computing  model. Participating in FUN is not something you are likely to regret. Tami Tamir is the PC chair of this year’s conference (FUN 2024). Here is the link for more details on the conference itself and the whole series of conferences. The conference will take place on June 4 – 8, 2024 in Island of La Maddalena, Sardinia, Italy. The conference is going to have, as a special track chaired by Andrei Broder, a CS Salon des Refusés – dedicated to important results in CS theory that were rejected in their early attempt to be published.

Here is the conference’s call for papers. The deadline is February 20, 2024. The very same deadline applies to submissions for Salon de Refusés.

&&&&&&&&&&&&&&&&&&

Our algorithm corner

About a decade ago we made here the following announcement: “while chatting with Yuval Rabani and Daniel Spielman I realized that there are various exciting things happening in algorithms (and not reported so much in blogs). Much progress has been made on basic questions: TSP, Bin Packing, flows & bipartite matching, market equilibria, and k-servers, to mention a few, and also new directions and methods. I am happy to announce that Yuval kindly agreed to write here an algorithmic column from time to time, and Daniel is considering contributing a guest post as well.” We are not in a hurry of any kind but I will try to check if the algorithm column idea could be revived.

Recent posts here on the blog

Here are links to our five most recent posts with very interesting mathematical news:

1) Marcelo Campos, Matthew Jenssen, Marcus Michelen and, and Julian Sahasrabudhe: Striking new Lower Bounds for Sphere Packing in High Dimensions;

2) On Viazovska’s modular form inequalities by Dan Romik;

3) Oberwolfach Workshop: Geometric Algebraic and Topological Combinatorics 2023, part I;

4) Progress Around Borsuk’s Problem

5) Marton’s “Polynomial Freiman-Ruzsa” Conjecture was Settled by Tim Gowers, Ben Green, Freddie Manners and Terry Tao

More coming soon.