The hottest Combinatorics Substack posts right now

And their main takeaways
Category
Top Science Topics
A Piece of the Pi: mathematics explained 36 implied HN points 21 Feb 25
  1. Dimer tilings involve arranging domino-shaped pieces on grids, and how many ways you can arrange them can vary based on the layout. For example, on a 3x3 grid with one space empty, there are 18 different arrangements.
  2. If at least one dimension of a rectangle is even, it's possible to cover it completely with dimers. However, if both dimensions are odd, it's impossible to cover them without leaving gaps.
  3. There are mathematical patterns and theorems, like Gomory's Theorem, that help understand how to tile grids with dimers. These principles can show when tiling is possible based on the arrangement and color of squares.
A Piece of the Pi: mathematics explained 163 implied HN points 16 Dec 24
  1. The number e, around 2.718, plays a big role in math, especially in combinatorial problems like derangements. This is when items are arranged so that none are in their original position.
  2. In chess, setting up nonattacking rooks can be related to derangements. The chance that none of them land on the main diagonal equals about 36.8%, which links back to the number e.
  3. Recent studies have also looked at how many safe squares remain on a chessboard when placing random pieces. As more pieces are added, the proportion of safe squares follows certain patterns connected to e.
Infinitely More 17 implied HN points 17 Nov 24
  1. A permutation is just a way to rearrange a list of objects. For example, with three letters like 'a', 'b', and 'c', you can arrange them in six different ways.
  2. The factorial of a number shows how many ways you can arrange that many objects. For example, 5! equals 120 because it's 5 times 4 times 3 times 2 times 1.
  3. When choosing items from a group without caring about the order, we use combinations. The formula for this is called 'n choose k', which helps calculate how many ways you can select items.
Technology Made Simple 139 implied HN points 22 Nov 23
  1. God's Algorithm aims for the fewest moves possible in combinatorial games like Rubik's Cube.
  2. Researchers found God's Number for Rubik's Cube using techniques like partitioning, symmetry, and dropping optimality.
  3. Key strategies used were dividing the problem into smaller parts, leveraging symmetry to reduce work, and focusing on finding solutions within 20 moves instead of the best possible solution.
The Software & Data Spectrum 78 implied HN points 13 Apr 23
  1. Bayesian Statistics is used in various fields like Machine Learning, Engineering, Data Science, and more.
  2. Bayesian Thinking involves observing data, holding prior beliefs, forming hypotheses, gathering evidence, and comparing hypotheses.
  3. Probability is a way to measure belief strength, and calculating probabilities involves counting outcomes and using ratios of beliefs.
Get a weekly roundup of the best Substack posts, by hacker news affinity:
Technology Made Simple 39 implied HN points 07 Sep 22
  1. The post discusses a problem related to creating a suitable music playlist for a road trip, requiring a certain number of songs and buffer between repeats.
  2. It emphasizes the importance of dynamic programming, logic, and combinatorics in solving the mentioned playlist problem.
  3. The post also includes requests to engage with and share the newsletter, showcasing the value of community support and feedback.
Technology Made Simple 19 implied HN points 17 Jun 22
  1. When faced with a problem involving combinatorics, taking the time to read and analyze the question can provide crucial insights for a more efficient solving approach
  2. In the context of building max heaps from a list of integers, understanding the structure of heaps as complete binary trees allows for simplification of the problem into calculating combinations and values for left and right subtrees
  3. Calculating the values for the left subtree, such as height and number of nodes, can lead to a shift in the coding task complexity from generating heaps to conducting combinatorics
Technology Made Simple 19 implied HN points 15 Jun 22
  1. The post discusses a coding interview question about finding the number of distinct ways to create a max heap from a list of integers.
  2. It emphasizes the importance of practicing unique interview questions to prepare for a variety of challenges.
  3. The author shares personal anecdotes and encourages engaging with the content by sharing preferences for future topics.
Technology Made Simple 19 implied HN points 06 Jan 22
  1. Creating a brute force solution can guide towards an optimal solution, but in interviews, it's better to showcase understanding and move on to more effective approaches
  2. Greedy algorithms are straightforward and choose the best option at each step, making them applicable for optimization problems like arranging couples
  3. Optimal algorithms, like the greedy approach, can be efficient because they make choices based on immediate benefit, even though they may overlook long-term gains