Table of Contents
Is combinatorics pure or applied?
It started as a part of combinatorics and graph theory, but is now viewed as a branch of applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory.
Is combinatorics used in data science?
One of the more entertaining and useful branches of mathematics (for applying numbers to data science problems) is combinatorics, which focuses on combinations of objects that belong to a finite (countable) set, subject to specific constraints or criteria. …
What is difference between pure and applied mathematics?
The easiest way to think of it is that pure maths is maths done for its own sake, while applied maths is maths with a practical use. It solves problems, finds facts and answers questions that don’t depend on the world around us, but on the rules of mathematics itself.
What should I know about research in combinatorics/discrete mathematics?
But, you should know that research in combinatorics/discrete mathematics is much, much more than just solving such problems. Firstly, a lot of the research in combinatorics today is done using tools and ideas from other areas of mathematics (and the demarcation between different areas of mathematics is quite fuzzy).
What is combinatorics in Computer Science?
Combinatorics concerns the study of discrete objects. It has applications to diverse areas of mathematics and science, and has played a particularly important role in the development of computer science. While it is arguably as old as counting, combinatorics has grown remarkably in the past half century alongside the rise of computers.
What are the prerequisites for learning combinatorics?
For example, you need a good background in topology (both general and algebraic) to tackle problems in Topological combinatorics, and you need a good background in group theory, linear algebra, representation theory to get into Algebraic combinatorics. See the wikipedia entry on various other such subfields of Combinatorics.
Who is the father of enumerative/algebraic combinatorics?
The late Gian-Carlo Rota is regarded as the founding father of modern enumerative/algebraic combinatorics, transforming it from a bag of ad hoc tricks to a deep, unified subject with important connections to other areas of mathematics.