This is YBC 7289, a Babylonian tablet from 1800 BC – 1600 BC showing the sides and diagonals of a square with a very accurate sexagesimal approximation to the square root of two, "the greatest known computational accuracy ... in the ancient world". Now a Good Article on Wikipedia,

New blog post "Mutual nearest neighbors versus closest pairs" (, introducing my latest arXiv preprint, "Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains" (with Efrat, Frishberg, Goodrich, Kobourov, Mamano, Matias, and Polishchuk,

@bremner Despite seeing so little of it in your shot, that looks like a familiar setting.

You can't pack uncountably many Möbius strips into 3d space:

Known since the early 1960s for polyhedral embeddings, this has been recently generalized to arbitrarily messy topological embeddings, and to higher dimensions, in two papers by Olga Frolkina and by Sergey Melikhov.

Paul Erdős died in 1996, but his most recent paper is from 2015, nearly 20 years later! There's a writeup at; the paper itself is

It's about Egyptian fractions – representations of rationals as sums of distinct unit fractions – and is motivated by the conjecture that it's always possible for all denominators to be semiprime. That's still open, but they prove that every integer has a representation with all denominators products of three primes.

@RefurioAnachro Thanks for the fixed link. I had saved it for later reading but hadn't gotten to it yet so didn't notice. \(\mathbb{F}_1\) is always fun...

A comparison of two parallel Canadian grant funding tracks shows that when reviewers are told to focus on the investigator rather than the proposed investigation, they are significantly more biased against women:

Choose a random graph with countably infinite vertices by flipping a coin to decide whether to include each edge. Or, construct a graph with binary numbers as vertices, with an edge \(x\)—\(y\) when \(x<y\) and the \(x\)th bit of \(y\) is one. Or, construct a graph on primes congruent to 1 mod 4, with an edge when one is a quadratic residue mod the other. They're all the same graph, the Rado graph (! It has many other amazing properties. Now a Good Article on Wikipedia.

Elsevier news roundup: German, Hungarian, and Swedish academics have been cut off from Elsevier journals after subscription negotiations broke down ( Negotiations with the University of California are ongoing after a missed deadline ( Access to Germany was restored ( but without any long-term agreement. And the editorial board of _Informetrics_ resigned to protest Elsevier's open access policies (

The list of accepted papers from this year's Symposium on Computational Geometry just came out:

Four of Conway's five $1000-prize problems ( remain unsolved:

*The dead fly problem on spacing of point sets that touch all large convex sets,

*Existence of a 99-vertex graph with each edge in a unique triangle and each non-edge the diagonal of a unique quadrilateral,

*The thrackle conjecture, on graphs drawn so all edges cross once,

*Who wins Sylver coinage after move 16?

@jsiehler @axiom If it has a name or prior publications I don't know about it. But it reminds me of several other more well-studied concepts:

* partial cubes (label vertices by bitstrings, not necessarily using all strings, so that Hamming distance = graph distance)

* graceful graphs (label vertices by numbers so that the differences of labels on the endpoints of each edge are the numbers from 1 to )

* Tutte embedding, each vertex is centroid of neighbors

0xDE boosted

Three-regular, each 5-bit label appears exactly once, each vertex is the sum (xor) of its neighbors.

@jsiehler Any idea whether you can label the Dyck graph ( in the same way? Or is it just this graph?

0xDE boosted

Finished my stained glass course, and the Menger sponge piece I was making over the course of it. Really, really happy with the results, and to have learned about this medium; the whole process was interesting and I wrote about it (with lots of pictures) here:

#art #fractal

Did you know that two different graphs with 81 vertices and 20 edges/vertex are famous enough to have Wikipedia articles?

The strongly regular Brouwer–Haemers graph ( connects elements of GF(81) that differ by a fourth power.

The Sudoku graph ( connects cells of a Sudoku grid that should be unequal. Sudoku puzzles are instances of precoloring extension on this graph.

Unfortunately the natural graphs on the 81 cards of Set have degree ≠ 20...

"Ancient Turing Pattern Builds Feathers, Hair — and Now, Shark Skin": _Quanta_, and original article in _Science Advances_,

Researchers at the University of Florida led by Gareth Fraser and his student Rory Cooper used reaction-diffusion patterns (also named "Turing patterns" after Turing's early work; see to model the distribution of scales on sharks, and performed knockdown experiments to validate their model in vivo.

The Cal Poly ag students have started selling these blood oranges at the local farmer's market, as they do every year around this time, only $1 for five. In the summer they sell sweet corn on the cob.

@janne Your response still demonstrates a lack of having read the article, because it raised exactly this argument as a straw man, only to point out that the same reviewer is free to continue doing the same thing at other journals.

Show more

A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.

Use \( and \) for inline LaTeX, and \[ and \] for display mode.