Equality & Stretchiness This is a brief addition to my last post. It used to be part of the post, but then the post was too long. Probably this needs to be edited into something else.
This is a musing on something I said in that post:
Digraphs are stretchy.
So for instance, we would consider these three digraphs to be the same, because we can rearrange and stretch them into each other:
(Addon to this post).
Bonus Exercise 1 What if we had a table with 3 columns? For example…
(suspect, murder_weapon, location)
This would be a way to draw a ternary relation. What other ways could we draw that relation? Consider…
Convert these pictures to a 3-column table. Make sure to add secondary tables of Suspects, Murder Weapons, and Locations. Add an extra row to your table. A new suspect, a new location… Convert your 2-row, 3-column table to a wacky-looking triple-digraph like the one above.
Intro This post is about three types of diagram: These look different, but they’re really just different ways to convey the same information. We’ll learn how to convert back and forth between them, which is a handy skill if you spot them in the wild. There’s a fancy name for these diagrams. If you want to impress people, you can call them all Binary Relation Diagrams. You could also just
(Or, “regularized greedy algorithms and their applications.”)
James Gilles
“Algorithm” is one of those words that sounds fancier than it really deserves. We hear all the time about the “facebook algorithm”, the “youtube algorithm”, “high frequency trading algorithms”, “artificial intelligence algorithms”, and so on. What are these, really?
The “facebook algorithm” is a large blob of software that Facebook uses to try to get people to stay on their website longer.