Hacker News with Generative AI: Combinatorics

What Every Programmer Should Know About Enumerative Combinatorics (leetarxiv.substack.com)
Enumerative combinatorics is a branch of mathematics focused on counting the elements of a set.
Mathematics, Programming, Combinatorics
91 points by muragekibicho 8 days ago | 45 comments
Orders of Infinity (wordpress.com)
Many problems in analysis (as well as adjacent fields such as combinatorics, theoretical computer science, and PDE) are interested in the order of growth (or decay) of some quantity that depends on one or more asymptotic parameters (such as ) – for instance, whether the quantity grows or decays linearly, quadratically, polynomially, exponentially, etc. in .
Mathematics, Asymptotic Analysis, Combinatorics, Differential Equations
82 points by matt_d 19 days ago | 15 comments
Analytic Combinatorics – A Worked Example (grossack.site)
Another day, another blog post that starts with “I was on mse the other day…”. This time, someone asked an interesting question amounting to “how many unordered rooted ternary trees with $n$ nodes are there, up to isomorphism?”. I’m a sucker for these kinds of combinatorial problems, and after finding a generating function solution I wanted to push myself to get an asymptotic approximation using Flajolet–Sedgewick style analytic combinatorics!
Mathematics, Combinatorics, Algorithms, Computer Science
105 points by mathgenius 45 days ago | 54 comments
Graph Theory and Additive Combinatorics (yufeizhao.com)
Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Graph Theory, Combinatorics, Mathematics, Computer Science
26 points by ibobev 63 days ago | 0 comments
Mathematics of the daily word game Waffle (arxiv.org)
We investigate the combinatorics of permutations underlying the the daily word game Waffle, and learn why some games are easy to solve while extreme games are very hard. A perfect unscrambling must have precisely 11 orbits, with at least one of length 1, on the 21 squares.
Mathematics, Word Games, Combinatorics, Algorithms, Games
58 points by belter 126 days ago | 19 comments
Minimum bipartite matching via Riemann optimization (2023) (ocramz.github.io)
Some time ago I ran into two separate instances of the same combinatorial optimization problem in the span of a few days, and decided to read up a little on the fundamentals. The two applications were object tracking in videos, and peak alignment in chromatography data.
Optimization, Algorithms, Combinatorics, Computer Science
80 points by f1shy 138 days ago | 23 comments