3 ms·
In discrete mathematics (combinatorics) there are definitely some tools and techniques but seemingly every problem is unique, I’m not quite sure that pattern ma
by JacobiX 5y ago
In discrete mathematics (combinatorics) there are definitely some tools and techniques but seemingly every problem is unique, I’m not quite sure that pattern matching is very useful in this subfield of mathematics ?
- Ericson2314 5y agoThat's why combinatorics is a bit of black sheep :D
- paulpauper 5y agoCombinatorics is just counting but can be so hard finding the shortcuts
- contravariant 5y agoYeah this view that it's all pattern matching isn't too helpful. I find it more helpful to consider mathematics the art of generalization. Discrete math is frequently about things with very little structure (e.g. graph theory, where you basically just have any binary relation), so inevitably ends up trying to prove things that are way too general. The flipside is that those theorems do tend to crop up everywhere.