Yuansi Chen's preprint, "An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture", arxiv.org/abs/2011.13661, is described less technically by Gil Kalai (gilkalai.wordpress.com/2020/12) and now Quanta (quantamagazine.org/statistics-)

It doesn't quite solve the Bourgain slicing conjecture, that high-dimensional convex bodies of unit volume have cross-sections of constant volume, but it reduces the dependence on dimension from a power of d to something smaller.

I am quite amused by "some unimpressed Wikipedia editor" in golem.ph.utexas.edu/category/2 and unable to explain why it is so amusing.

Tensioned suspension: bldgblog.com/2013/08/tensioned

Sculptures by Dan Grayber in which the weight of mechanical linkages causes them to push out against the sides of their glass enclosures, seemingly causing them to hang suspended in air.

Via news.ycombinator.com/item?id=9; more at Grayber's web site, dangrayber.com/

Applications of the no-3-in-line problem and cap-sets to complexity theory: rjlipton.wordpress.com/2021/02

"What is most curious to us is that for matrix multiplication, the cap-set related technique frustrates a better complexity upper bound, whereas [for linear algebraic circuits] it frustrates a better lower bound."

0xDE boosted

Today's LaTeX formatting tip: You know that bug where amsthm + hyperref, with one numbering for theorems and lemmas and corollaries and whatever, causes \autoref to call them theorems even when they're really lemmas and corollaries and whatever? If you don't, you're lucky. Anyway, there's a very simple workaround: after loading amsthm and hyperref, add one more package:


Then, just use \cref everywhere you were using \autoref

Problem solved!

I'm sad that the only way to find a viewable version of the 1991 short film Not Knot (on the hyperbolic geometry of knot complements) seems to be through pirate copies. Or you could pay $45 to Amazon for a copy on DVD. Do most people still have DVD players? At least they're not still trying to sell it on VHS only.

Gender Trends in Computer Science Authorship: cacm.acm.org/magazines/2021/3/

Takeaways for me (mostly from the barely-readable Fig. 4) are:
- Roughly one in four coauthors of CS research publications are currently female, up from a big dip of one in seven in the 1970s to 1990s
- Mathematics started lower and is currently more or less the same
- We are not on track to gender parity

Draw an infinite subgraph of the 3d integer lattice in which each vertex has four co-planar neighbors, in a perpendicular plane to each of its neighbors. This completely determines the subgraph, which is 4-regular and highly symmetric. It is the graph of adjacencies of the cubes in this structure: en.wikipedia.org/wiki/Tetrasti . Does this graph have a name and history?

Fun with shapes: draw an iceberg and see which way up and how deep it would float, joshdata.me/iceberger.html, inspired by a twitter thread by Megan Thompson-Munson, mobile.twitter.com/GlacialMeg/, pointing out that many supposed photos or illustrations of icebergs are fake and wrong.

Via news.ycombinator.com/item?id=2, metafilter.com/190533/Iceberge, and boingboing.net/2021/02/20/make

New blog post: Loops, degrees, and matchings, 11011110.github.io/blog/2021/0

What happens when you allow self-loops to be included in graph matchings? Not much different, it turns out.

Arranging invisible icons in quadratic time: randomascii.wordpress.com/2021, via news.ycombinator.com/item?id=2

Yet another instance where using a too-slow algorithm causes a UI hang, with the twist that the better solution would not be to replace it with a faster algorithm, but instead to not do the useless thing that the bad algorithm does at all.

A couple of days ago I posted a list of SoCG accepted papers but said that I couldn't find the STOC list. So here's the STOC list: acm-stoc.org/stoc2021/accepted

Computational Geometry YouTube channel: youtube.com/channel/UC8bRNi3tJ

This has been set up by @sarielhp and Sándor Fekete, and is recording talks from the New York Geometry Seminar. So far there are eleven, of roughly an hour length each.

A new contribution of Hypatia to mathematics: jdh.hamkins.org/ode-to-hippasu

Not the ancient Hypatia, but Hypatia Hamkins, and her parents, philosopher Barbara Gail Montero and logician Joel David Hamkins; the contribution is a verse proof of the irrationality of √2.

Accepted papers for the Symp. on Computational Geometry (SoCG 2021): cse.buffalo.edu/socg21/accepte

Decisions are out for the Symp. on Theory of Computing (STOC) but I haven't seen a public list yet.

Upcoming submission deadlines include the Algorithms and Data Structures Symp. (WADS, Feb. 20, projects.cs.dal.ca/wads2021/), Graph-Theoretic Concepts in CS (WG, Mar. 3, wg2021.mimuw.edu.pl/), and the new SIAM Conf. on Applied and Computational Discrete Algorithms (ACDA21, Mar. 1), siam.org/conferences/cm/confer

Self-organizing textures: distill.pub/selforg/2021/textu

A small input image + "neural cellular automata" magic leads to organic-looking image textures. Via news.ycombinator.com/item?id=2

The compound of an 11-simplex in an 11-hypercube (as a subset of its vertices) has the Mathieu group M11 as its symmetries: mathoverflow.net/q/382940/440, via cp4space.hatsya.com/2021/02/08

The cp4space post goes on to describe how to find two dual 11-simplices in the same hypercube from the perfect ternary Golay code, much like the two simplices in a 3-cube that form the stella octangula.

Show older

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!