Tricki
a repository of mathematical know-how
Add article
Navigate
Tags
Search
Forums
Help
Top level
›
What kind of problem am I trying to solve?
View
Edit
Revisions
Techniques for counting
Title:
*
Area of mathematics:
*
A comma-separated list of areas of mathematics to which this article applies. Use ">" to tag in a subcategory. Example: Analysis > Harmonic analysis, Combinatorics
Keywords:
A comma-separated list of keywords associated with this article. Example: free group
Used in:
A comma-separated list of examples of where this technique is used. Example: Cauchy-Schwarz inequality
Parent articles:
Order
-1
0
1
-1
0
1
Body:
[QUICK DESCRIPTION] Counting techniques are used predominantly in combinatorial fields, but are occasionally borrowed for a proofs in other branches of mathematics. This (unfinished) article is a quick resource to point the user towards some of the combinatorial techniques developed to count discrete objects, and specific examples of how counting techniques have been applied in different fields. ===Discussion of Prerequisites=== Certain counting techniques require almost no background knowledge. Basic combinatorial arguments, those that deal with finite arrangements of a finite number of objects, require a background in Algebra, and an understanding of the factorial function. More advanced combinatorics requires linear algebra and exposure to recurrence relations. The more advanced combinatorial techniques require a background in calculus and differential equations, as typical advanced techniques involve generating functions. Combinatorics is the basis for counting techniques. If you are looking to learn how to solve certain problems, see the [[Combinatorics front page]]. Otherwise the techniques below should help to serve your purposes. ===Techniques=== [[Elementary counting techniques]] [[Combinations and Permutations]] [[Binomial Theorem]] [[List of Combinatorial Identities]] [[Recurrence Relations]] [[Generating Functions]] [[Applying the probabilistic method|Probabilistic Method]] [[Sieve Method]] [[Combinatorial Snake Oil Method]] [[Wilf-Zeilberger Lemma]] ===Counting Techniques in Other Fields=== [[Counting Techniques in Set Theory]] [[Counting Techniques in Graph Theory]] [[Counting Techniques in Topology]] [[Counting Techniques in Knot Theory]] [[Counting Techniques in Geometry]]
This is a stub
A stub is an article that is not sufficiently complete to be interesting.
Notifications
File attachments
Changes made to the attachments are not permanent until you save this post. The first "listed" file will be included in RSS feeds.
Attach new file:
Images are larger than
640x480
will be resized. The maximum upload size is
1 MB
. Only files with the following extensions may be uploaded:
jpg jpeg gif png svg
.
Revision information
Log message:
An explanation of the additions or updates being made to help other authors understand your motivations.
Search this site:
Recent articles
View a list of all articles.
Littlewood-Paley heuristic for derivative
Geometric view of Hölder's inequality
Diagonal arguments
Finding an interval for rational numbers with a high denominator
Try to prove a stronger result
Use self-similarity to get a limit from an inferior or superior limit.
Prove a consequence first
Active forum topics
Plenty of LaTeX errors
Tutorial
A different kind of article?
Countable but impredicative
Tricki Papers
more
Recent comments
I don't think this statement
choice of the field
Incorrect Image
Article classification
Higher dimensional analogues
more