Search results
Jump to navigation
Jump to search
Page title matches
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...32 KB (5,800 words) - 07:57, 21 May 2014
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...25 KB (4,523 words) - 13:54, 27 December 2015
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 02:49, 24 November 2016
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 13:32, 2 December 2017
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...32 KB (5,780 words) - 07:54, 28 November 2019
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...50 KB (8,991 words) - 12:23, 21 May 2023
- ...t system is a '''sunflower''' if all its member sets intersect at the same set of elements. : A set family <math>\mathcal{F}\subseteq 2^X</math> is a '''sunflower''' of size < ...50 KB (8,991 words) - 09:48, 20 May 2024
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,389 words) - 09:05, 12 January 2011
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...25 KB (4,408 words) - 01:20, 10 November 2011
- A set family <math>\mathcal{F}\subseteq 2^X</math> with the relation <math>\subse A set family <math>\mathcal{F}\subseteq 2^X</math> is an '''antichain''' (also ca ...24 KB (4,365 words) - 11:50, 5 June 2013
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 04:58, 17 November 2010
- :Let <math>\mathcal{F}\subseteq 2^X</math> be set family and let <math>R\subseteq X</math> be a subset. The '''trace''' of <m ...nsion '''VC dimension'''] is defined by the power of a family to shatter a set. ...25 KB (4,480 words) - 08:23, 16 August 2011
Page text matches
- #REDIRECT [[Combinatorics (Fall 2010)/Extremal set theory II]] ...62 bytes (7 words) - 06:45, 3 November 2010
- This is a (temporary) homepage for the probability theory course at Zhiyuan college. *[[概率论 (Summer 2014)/Problem Set 1|Problem Set 1]], due on July 25, Friday, in class. ...203 bytes (26 words) - 11:41, 17 July 2014
- ...''B'' is ''greater than or equal to'' (or ''more than or equal'' members) set ''B'' if and only if there is an injective function from ''A'' to ''B''. ...set is only one way of giving a number to the ''size'' of a set. [[Measure theory|Measure]] is different. ...2 KB (375 words) - 06:00, 4 July 2015
- This is a (temporary) homepage for the probability theory course at Zhiyuan college. *[[概率论 (Summer 2013)/Problem Set 1|Problem Set 1]], due on July 11, Thursday, in class. ...572 bytes (68 words) - 09:02, 1 August 2013
- * 概率论（Probability Theory） *[[组合数学 (Fall 2016)/Problem Set 1|Problem Set 1]] due on Oct. 10 in class. ...6 KB (479 words) - 10:20, 12 September 2017
- ...'proper subset'''. We use the symbol ⊆ to say a set is a subset of another set. We can also use ⊂ if it is a proper subset. The symbols ⊃ ⊇ are opposite - ...[interval]] [0;1] is a proper subset of the set of [[real number]]s or the set of [[positive number]]s. ...980 bytes (159 words) - 10:02, 8 June 2017
- ...]], an '''alphabet''' is a [[finite set|finite]] [[empty set|non-empty]] [[set]]. The [[element]]s of an alphabet are called the '''letters''' or '''symbo The set of [[natural number]]s is '''not''' an alphabet because as it is not finite ...3 KB (400 words) - 06:51, 6 July 2016
- ...artesian product''' of ''A'' with ''B'' is written as ''A × B'' and is the set of all [[ordered pair|ordered pairs]] whose first element is a member of '' [[Category:Set theory]] ...497 bytes (82 words) - 22:03, 12 March 2013
- ...algebraic structure]]. It is a [[set]] with a [[binary operation]] on that set. ...that do not have to be different) and returning some other element of that set. ...1 KB (250 words) - 05:20, 8 November 2014
- ...of a [[set]] is the cardinal number that tells how many things are in the set. [[Category:Number theory]] ...1 KB (154 words) - 17:56, 8 October 2014
- * 概率论（Probability Theory） *[[组合数学 (Spring 2014)/Problem Set 1|Problem Set 1]], due on March 27, Thursday, in class. ...9 KB (998 words) - 05:12, 11 June 2014
- ...set. Both elements b and c of the first set map to element z of the second set.]] The relation is ''homogeneous'' when it is formed with one set. ...4 KB (674 words) - 06:35, 19 August 2017
- * 概率论（Probability Theory） *[[组合数学 (Spring 2013)/Problem Set 1|Problem Set 1]], due on April 4, Thursday, in class. ...11 KB (1,243 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2015)/Problem Set 1|Problem Set 1]] due on Oct. 13 in class. ...11 KB (1,070 words) - 12:46, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2017)/Problem Set 1|Problem Set 1]] due on Oct 9, in class. ...11 KB (1,223 words) - 07:38, 2 January 2018
- * 概率论（Probability Theory） * (2011/09/15) [[组合数学 (Fall 2011)/Problem set 1|Problem set 1]] due on Sept 22, in class. ...13 KB (1,447 words) - 12:47, 15 September 2017
- * 概率论（Probability Theory） *[[组合数学 (Fall 2019)/Problem Set 1|Problem Set 1]] due on Sept 25, in class. [[组合数学 (Fall 2019)/作业1已提交名单 | 当前作业1已提交名单]]. ...12 KB (1,290 words) - 06:43, 27 December 2019
- * 概率论（Probability Theory） * (2010/09/17) [[Combinatorics (Fall 2010)/Problem set 1|Problem set 1]] due on Sept 25, in class. ...12 KB (1,494 words) - 14:27, 3 September 2011
- * 概率论（Probability Theory） * [[组合数学 (Fall 2023)/Problem Set 1|Problem Set 1]]，请在 2023/03/24 上课之前提交到 [mailto:njucomb23@163.com njucomb23@163.com] (文件名 ...14 KB (1,438 words) - 18:58, 9 April 2024
- * 概率论（Probability Theory） * [[组合数学 (Spring 2024)/Problem Set 1|Problem Set 1]] [[组合数学 (Spring 2024)/第一次作业提交名单|第一次作业提交名单]] ...14 KB (1,492 words) - 06:39, 19 June 2024