All public logs
Jump to navigation
Jump to search
Combined display of all available logs of TCS Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
- 14:25, 29 March 2023 Etone talk contribs created page 组合数学 (Fall 2023)/Pólya's theory of counting (Created page with "== Groups == A group <math>(G,\cdot)</math> is set <math>G</math> along with a binary operator <math>\cdot</math> which satisfies the following axioms: * ''closure'': <math>\forall g,h\in G, g\cdot h \in G</math>; * ''associativity'': <math>\forall f,g,h\in G, f\cdot(g\cdot h)=(f\cdot g)\cdot h</math>; * ''identity'': there exists a special element <math>e\in G</math>, called the '''identity''', such that <math>e\cdot g=g</math> for any <math>g\in G</math>; * ''inverse''...")
- 10:29, 27 March 2023 Zhangxy talk contribs created page 概率论与数理统计 (Spring 2023)/Problem Set 2 (Created page with "== Problem 1 (Warm-up problems) == <ul> <li>[<strong>Function of random variable (I)</strong>] Let [math]X[/math] be a random variable and [math]g:\mathbb{R} \to \mathbb{R}[/math] be continuous and strictly increasing. Show that [math]Y = g(X)[/math] is a random variable.</li> <li>[<strong>Function of random variable (II)</strong>] Let [math]X[/math] be a random variable with distribution function [math]\max(0,\min(1,x))[/math]. Let [math]F[/math] be a distribution func...") Tag: Visual edit: Switched
- 09:08, 27 March 2023 Roundgod talk contribs created page 组合数学 (Spring 2023)/第一次作业提交名单 (Created page with "如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 191220020 || 戴一帆 |- | 191220060 || 林荣恩 |- | 191250004 || 曹雨森 |- | 191250127 || 孙伟杰 |- | 191250145 || 王子鉴 |- | 191820255 || 臧正贻 |- | 201180088 || 陈浩楠 |- | 201220011 || 章正辉 |- | 201220035 || 丁天行 |- | 201220043 || 吕培锋 |- | 201220073 || 曹云帆 |- | 201220092 || 吴杰伦 |- | 201220098 || 杨林 |- | 20122010...")
- 04:03, 26 March 2023 Chenxiaoyu talk contribs created page File:计算方法 Numerical method (Spring 2023)-计算方法5.pdf
- 04:03, 26 March 2023 Chenxiaoyu talk contribs uploaded File:计算方法 Numerical method (Spring 2023)-计算方法5.pdf
- 07:30, 24 March 2023 Zouzongrui talk contribs created page 概率论与数理统计 (Spring 2023)/第一次作业提交名单 (submission_list) Tag: Visual edit
- 06:56, 17 March 2023 Xyfu talk contribs moved page File:计算方法4.pdf to File:计算方法 Numerical method (Spring 2023)-计算方法4.pdf
- 06:46, 17 March 2023 Xyfu talk contribs created page File:计算方法4.pdf
- 06:46, 17 March 2023 Xyfu talk contribs uploaded File:计算方法4.pdf
- 12:45, 16 March 2023 Etone talk contribs created page 组合数学 (Fall 2023)/Sieve methods (Created page with "== Principle of Inclusion-Exclusion == Let <math>A</math> and <math>B</math> be two finite sets. The cardinality of their union is :<math>|A\cup B|=|A|+|B|-{\color{Blue}|A\cap B|}</math>. For three sets <math>A</math>, <math>B</math>, and <math>C</math>, the cardinality of the union of these three sets is computed as :<math>|A\cup B\cup C|=|A|+|B|+|C|-{\color{Blue}|A\cap B|}-{\color{Blue}|A\cap C|}-{\color{Blue}|B\cap C|}+{\color{Red}|A\cap B\cap C|}</math>. This is illu...")
- 07:00, 16 March 2023 Roundgod talk contribs created page 组合数学 (Fall 2023)/Problem Set 1 (Created page with "== Problem 1 == Fix positive integers <math>n</math> and <math>k</math>. Let <math>S</math> be a set with <math>|S|=n</math>. Find the number of <math>k</math>-tuples <math>(T_1,T_2,\dots,T_k)</math> of subsets <math>T_i</math> of <math>S</math> subject to each of the following conditions separately. Briefly explain your solution. * <math>T_1\subseteq T_2\subseteq \cdots \subseteq T_k.</math> * The <math> T_i</math>s are pairwise disjoint. * <math> T_1\cup T_2\cup \cdot...")
- 16:10, 15 March 2023 Chenxiaoyu talk contribs created page 计算方法 Numerical method (Spring 2023)/Homework2 提交名单 (Created page with " 如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 211240009 || 陆一阳 |- | 211240066 || 肖雨辰 |- | 211502005 || 黄逸飞 |- | 211220118 || 刘艺葳 |- | 211502013 || 张逸飞 |- | 211220009 || 韦玮 |- | 201180132 || 徐宸宇 |- | 211502014 || 刘奕 |- | 211502020 || 周相羽 |- | 211502008 || 李诚希 |- | 211220093 || 曹博晗 |- | 211220121 || 唐周旋 |- | 211220018 || 陈润涛 |- | 211240019 || 姜宇翔 |...")
- 11:18, 15 March 2023 Chenxiaoyu talk contribs created page File:计算方法 Numerical method (Spring 2023)-Assignments3.pdf
- 11:18, 15 March 2023 Chenxiaoyu talk contribs uploaded File:计算方法 Numerical method (Spring 2023)-Assignments3.pdf
- 17:35, 11 March 2023 Etone talk contribs created page 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm (Created page with "= Graph Cut = Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''disconnected'' after deleting all edges in <math>C</math>. Let <math>\{S,T\}</math> be a '''bipartition''' of <math>V</math> into nonempty subsets <math>S,T\subseteq V</math>, where <math>S\cap T=\emptyset</math> and <math>S\cup T=V</math>. A cut <math>C</math> is specified by this bipartition as...")
- 16:43, 11 March 2023 Etone talk contribs created page 概率论与数理统计 (Spring 2023)/Polynomial identity testing (Created page with "=Polynomial Identity Testing (PIT) = The '''Polynomial Identity Testing (PIT)''' is such a problem: given as input two polynomials, determine whether they are identical. It plays a fundamental role in ''Identity Testing'' problems. First, let's consider the univariate ("one variable") case: * '''Input:''' two polynomials <math>f, g\in\mathbb{F}[x]</math> of degree <math>d</math>. * Determine whether <math>f\equiv g</math> (<math>f</math> and <math>g</math> are identica...")
- 06:12, 10 March 2023 Chenxiaoyu talk contribs created page File:计算方法 Numerical method (Spring 2023)-计算方法3.pdf
- 06:12, 10 March 2023 Chenxiaoyu talk contribs uploaded File:计算方法 Numerical method (Spring 2023)-计算方法3.pdf
- 15:25, 3 March 2023 Zhangxy talk contribs created page 概率论与数理统计 (Spring 2023)/Problem Set 1 (Created page with "*目前作业非最终版本。 *每道题目的解答都要有<font color="red" size=5>完整的解题过程</font>。中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 Without further notice, we are working on probability space <math>(\Omega,\mathcal{F},\mathbf{Pr})<\math>. == Problem 1 ==")
- 08:31, 3 March 2023 Etone talk contribs created page 组合数学 (Fall 2023)/Generating functions (Created page with "== Generating Functions == In Stanley's magnificent book ''Enumerative Combinatorics'', he comments the generating function as "the most useful but most difficult to understand method (for counting)". The solution to a counting problem is usually represented as some <math>a_n</math> depending a parameter <math>n</math>. Sometimes this <math>a_n</math> is called a ''counting function'' as it is a function of the parameter <math>n</math>. <math>a_n</math> can also be tre...")