Báo cáo toán học: "Cycle lengths in a permutation are typically Poisson" pot

... teaching Chinese as a foreign language: A case study of native Chinese teachers in Beijing. In Language alternation, language choice and language encounter in international education, eds. Hartmut ... words: Chinese as a foreign language; English as a lingua franca; Sinophone identity; code choice; multilingual classroom Background While Chine...

Ngày tải lên: 20/06/2014, 21:20

...

Ngày tải lên: 05/08/2014, 09:46

...

Ngày tải lên: 05/08/2014, 15:20

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 15:21

... Stress Field in an Elastic Strip in Frictionless Contact with a Rigid Stamp 475 2. D. D. Ang, Stabilized aproximate solution of certain integral equations of first kind arizing in mixed ... 469–475 StressFieldinanElasticStripin Frictionless Contact with a Rigid Stamp * Dang Dinh Ang Institute of Applie d Mechanics 291 Dien Bien Phu Str., 3 Distr., Ho Chi Min...

Ngày tải lên: 06/08/2014, 05:20

... Hook lengths in a skew Young diagram Svante Janson Department of Mathematics, Uppsala University PO Box 480, S-751 06 Uppsala, Sweden svante.janson@math.uu.se Submitted: October 15, 1997; Accepted: ... 1997 Abstract Regev and Vershik (Electronic J. Combinatorics 4 (1997), #R22) have obtained some properties of the set of hook lengths for certain skew Young diagrams, using...

Ngày tải lên: 07/08/2014, 06:20

... that the set of permutations generated by a stack of depth two and an in nite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutations of length 5, 6, 7 and ... following are equivalent. 1. σ can be generated by a stack of depth two and an in nite stack. 2. σ can be generated by Algorithm 4. 3. σ...

Ngày tải lên: 07/08/2014, 13:21

... theory and combinatorics ex- amining the distributions of sets of eigenvalues and zeros, and of natural invariants of permutations (for example, the “largest increasing subsequence” of a permutation) . ... times of a random variable are “randomly distributed”. However, in our question we do not have random variables. Indeed the set of permutations on n letters are pre-determined, a...

Ngày tải lên: 07/08/2014, 13:21

... Published: May 5, 2008 Mathematics Subject Classification: 9 1A2 4 Abstract The graph (non-)planarity game is played on the complete graph K n between an Enforcer and an Avoider, each of whom take one ... planar graph game on n vertices, Avoider can play at least 3n − 26 edges while keeping his graph planar. Motivation and History Positional games consist of a board, which is a fi...

Ngày tải lên: 07/08/2014, 15:22

...

Ngày tải lên: 07/08/2014, 18:21

... Vu. Additive Combinatorics. Cambridge University Press, 2006. [15] Le Anh Vinh, On the number of orthogonal systems in vector spaces over finite fields, Electronic Journal of Combinatorics, 15(1) ... a set can be without containing orthogonal k-tuples for k > 2. the electronic journal of combinatorics 15 (2008), #R151 9 Orthogonal systems in vector spaces over finit...

Ngày tải lên: 07/08/2014, 21:21

... Lemma 1 For convenience we shall assume that the set B is independent. Also, we shall call a pat h with both ends in A an A- path. Claim 6 If G contains an A- path of order p > 2, then G contains ... Nikifor ov, The spectral radius of graphs without paths and cycles of specified length, to appear in Linear Algebra Appl. Preprint available at arXiv:0903.535 [6] J. Verstraăete,...

Ngày tải lên: 08/08/2014, 01:20

... journal of combinatorics 17 (2010), #R19 14 Counting subwords in a partition of a set Toufik Mansour Department of Mathematics, University of Haifa, 31905 Haifa, Israel toufik@math.haifa.ac.il Mark ... − xA a 1 , which implies that A a = A a−1 + xA a 1  A a−1 −  a 2 m−1  x ℓ−2 (1 − y)  1 − xA a 1 = A a−1  1 −  a 2 m−1  x ℓ−1 (1 − y)  1 − xA a 1 . the el...

Ngày tải lên: 08/08/2014, 11:20

... On colorings avoiding a rainb ow cycle and a fixed monochromatic subgraph Maria Axenovich ∗ JiHyeok Choi Department of Mathematics, Iowa State University, Ames, IA 50011 axenovic@iastate.edu, ... induce a star. 1 Introduction and main results Fo r two graphs G and H, an edge coloring of a complete graph is called (H, G)- good if there is no monochromatic copy of G...

Ngày tải lên: 08/08/2014, 12:22

... of Mathematics & Statistics University of Western Australia, Australia gordon@maths.uwa.edu.au Dave Wagner Department of Combinatorics and Optimization University of Waterloo, Canada dgwagner@math.uwaterloo.ca Submitted: ... (2011), #P151 13 Chromatic Roots of a Ring of Four Cliques F.M. Dong ∗ Mathematics and Mathematics Education, National Institute of Education N...

Ngày tải lên: 08/08/2014, 14:23