[ home ] [ math / cs / ai / phy / as / chem / bio / geo ] [ civ / aero / mech / ee / hdl / os / dev / web / app / sys / net / sec ] [ med / fin / psy / soc / his / lit / lin / phi / arch ] [ off / vg / jp / 2hu / tc / ts / adv / hr / meta / tex ] [ chat ] [ wiki ]

Viewing source code

The following is the source code for post >>>/math/723

>>722
a math problem general should have some variety but besides that, combinatorics isn't a useful thing to study directly and its problems are ultimately better understood and solved in representation theory frameworks.
when you understand a problem well you are able to turn it into some kind of elementary computations/combinatorics, but this isn't an indication to study combinatorics specifically, than to study mathematics which is inherently meaningful and learn how to convert the abstract formulation

combinatorics really is a subset of other more important stuff, you get combinatorial tools in algebraic topology, number theory, algebraic geometry, homotopy. e.g. simplicial sets contain a lot of what you would ever do with graphs. in number theory you have trees coming from finite fields. in algebraic geometry you have combinatorics of the grasmannian, riemann surfaces, combinatorial ideals, matroids.
just learn other stuff, plain combinatorics is a fad driven by funding for "applied math" and computer science departments. serious combinatorialists (June Huh for example) end up studying homological algebra anyway