Search results
Jump to navigation
Jump to search
Page title matches
- '''Combinatorics''' is a branch of [[mathematics]] that concerns itself, at the elementary l ...l combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.1 KB (165 words) - 10:24, 18 June 2009
- | title = A course in combinatorics316 bytes (39 words) - 11:06, 18 June 2009
- 123 bytes (15 words) - 11:44, 18 June 2009
- ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}610 bytes (72 words) - 10:57, 18 June 2009
Page text matches
- ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}610 bytes (72 words) - 10:57, 18 June 2009
- '''Combinatorics''' is a branch of [[mathematics]] that concerns itself, at the elementary l ...l combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.1 KB (165 words) - 10:24, 18 June 2009
- The disciplines within mathematics that study discrete objects: combinatorics, graph theory, number theory, mathematical logic, …167 bytes (18 words) - 09:28, 18 June 2009
- | title = A course in combinatorics316 bytes (39 words) - 11:06, 18 June 2009
- {{r|Combinatorics}}255 bytes (36 words) - 11:43, 18 June 2009
- {{r|Combinatorics}}233 bytes (28 words) - 06:45, 15 July 2008
- {{r|Combinatorics}}245 bytes (29 words) - 09:38, 18 June 2009
- The '''Cameron–Erdős conjecture''' in the field of [[combinatorics]] is the statement that the number of [[sum-free set]]s contained in <math>368 bytes (56 words) - 11:47, 18 June 2009
- {{r|Combinatorics}}542 bytes (64 words) - 16:48, 11 January 2010
- {{r|Combinatorics}}441 bytes (57 words) - 16:21, 11 January 2010
- | title = Notes on introductory combinatorics731 bytes (88 words) - 06:16, 9 January 2008
- {{r|Combinatorics}}456 bytes (58 words) - 19:33, 11 January 2010
- {{r|Combinatorics}}489 bytes (62 words) - 20:38, 11 January 2010
- {{r|Combinatorics}}529 bytes (67 words) - 17:25, 11 January 2010
- {{r|Combinatorics}}547 bytes (69 words) - 15:56, 11 January 2010
- {{r|Combinatorics}}797 bytes (101 words) - 16:58, 11 January 2010
- {{r|Combinatorics}}654 bytes (81 words) - 13:36, 29 November 2008
- {{r|Combinatorics}}971 bytes (150 words) - 10:45, 4 October 2013
- ...nalysis|real]] and [[complex analysis]] to problems in [[algorithmics]], [[combinatorics]], [[number theory]], [[probability]] and other areas. It is the basis of1 KB (148 words) - 13:24, 19 December 2009
- ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}2 KB (200 words) - 13:08, 2 January 2013
- {{r|Combinatorics}}2 KB (262 words) - 19:07, 11 January 2010
- In [[combinatorics]], the '''Stirling numbers''' count certain arrangements of objects into a2 KB (240 words) - 13:34, 7 February 2009
- ...the following mathematical disciplines: [[algebra]], [[number theory]], [[combinatorics]] and [[geometry]]. On each day, the problems are in increasing order of di ...rtlist'' with 6-10 problems each from algebra, number theory, geometry and combinatorics.7 KB (1,063 words) - 10:07, 28 February 2024
- ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}2 KB (334 words) - 16:29, 7 February 2009
- ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}2 KB (307 words) - 16:08, 7 February 2009
- ...Chuan-Chong | coauthors=Koh Khee-Meng | title=Principles and Techniques of Combinatorics | publisher=[[World Scientific]] | year=1992 | isbn=981-02-1139-2 }}2 KB (336 words) - 07:17, 16 January 2009
- The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k3 KB (438 words) - 15:03, 30 November 2009
- ...r|author2-link=Peter Winkler | title=Three Thresholds for a Liar | journal=Combinatorics, Probability and Computing | year=1992 | volume=1 | pages=81–93 ([http://5 KB (793 words) - 05:49, 8 April 2024
- It is sometimes said that probabilistic combinatorics uses the fact that whatever happens with probability greater than <math>0</ ====Arithmetic combinatorics====27 KB (4,383 words) - 08:05, 11 October 2011
- In [[combinatorics]], the partial sums of the geometric series are essential for7 KB (1,134 words) - 16:18, 22 January 2010
- * Combinatorics6 KB (1,015 words) - 16:13, 6 May 2008
- ...Consolas">....I have two superheroes....One of them is metaphor, the other combinatorics. Metaphor would be the way in which we transfer and transform ways of think6 KB (1,033 words) - 17:25, 6 February 2010
- ...s, most research was done within its descendants, like probabilities and [[combinatorics]]. In [[combinatorics]], the Pascal's triangle is simply defined by <math>\scriptstyle \binom{n}{32 KB (4,192 words) - 18:42, 3 March 2024
- ...d is not too large. The size of a number or string key determines, due to combinatorics, the number of keys to be tried, so larger-sized keys generally take longer11 KB (1,819 words) - 05:48, 8 April 2024
- ...ing factorials, and the numerators, called the "tangent numbers", have a [[combinatorics|combinatorial]] interpretation: they enumerate [[alternating permutation]]s ...sponding factorials, the numerators, called the "secant numbers", have a [[combinatorics|combinatorial]] interpretation: they enumerate [[alternating permutation]]s33 KB (5,179 words) - 08:26, 4 June 2010
- ...ducts immediately leads to applications in many areas of mathematics; in [[combinatorics]], and by extension in areas such as [[probability theory]] and the calcula32 KB (5,024 words) - 12:05, 22 December 2008
- | [[Combinatorics]] || [[Theory of computation]] || [[Cryptography]] || [[Graph theory]]30 KB (4,289 words) - 16:03, 20 January 2023
- Chess is interesting from the mathematical point of view. Many [[combinatorics|combinatorical]] and [[topology|topological]] problems connected with it we64 KB (10,049 words) - 07:31, 20 April 2024