Báo cáo toán học: "A simple card guessing game revisited" docx

... considered the following simple combinatorial game; [5, 3, 7, 6]. One starts with a deck of cards consisting of m red and n black cards. A guess is made as to the colour of the top card, after which ... − 1), 0 ≤ n<m, the electronic journal of combinatorics 8 (no. 2) (2001), #R13 7 A simple card guessing game revisited Arnold Knopfmacher The John Knopfmacher Centre for Applicab...

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

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

... (Accessed: September 20, 1996). [3] P.K. Wong. Cages - a survey, JournalofGraphTheory,6, 1982, 1-22. A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16 Geoffrey Exoo Department

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

... A simple algorithm for constructing Szemer´edi’s Regularity Partition Alan Frieze Department of Mathematical ... University. kannan@cs.yale.edu † Submitted: November 25, 1998; Accepted: March 15, 1999. Abstract We give a simple constructive version of Szemer´edi’s Regularity Lemma, based on the computation of singular ... equitable partition P  (which is a refinement of P) into 1+k4 k cla...

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

... Bakos’s construction of Gray codes in [1] which was reformulated in a simple way by Knuth in [4, Theorem D]. This proof is much simpler than the one given in [10]. In the sequel, codewords in a Gray ... A simple proof for the existence of exponentially balanced Gray codes I Nengah Suparta ∗ Department ... in the sequence T . Note that the sum of all b(i), 1 ≤ i ≤ n,isequaltol, the length...

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

... #R18 7 Using the technique of a sign-reversing involution over a signed set, we prove that the cardinalities of Π n and Ω n coincide with the determinants of H (1) n and G (1) n , respectively. Following ... in [8, Solution of Exercise 6.49]. the electronic journal of combinatorics 12 (2005), #R18 4 A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu ∗ Department of Applied Mathematics...

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

... of v k−1 ; (2) v 1 must be the right child of its father (if exists). Theorem 2.1 There exists a simple bijection φ between B n and T n . Proof. We first give the procedure to construct a complete ... a complete binary tree as follows. the electronic journal of combinatorics 17 (2010), #N20 2 A simple bijection between binary trees and colored ternary trees Yidong Sun Department of Mathema...

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

... considerably easier. In particular, the existence problem of (sometimes simple) undirected graphs with given degree sequences even admits simple greedy algorithms for its solution. Subsequently, the theory ... exact definitions will come in Section 3). In 1955 P. Havel developed a simple greedy algorithm to solve the degree sequence problem for simple undirected graphs ([8]). In 1 960 P...

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

... model is motivated by the phenomenon of positive feedback, where the “rich get richer.” We derive a simple asymptotic expression for the prob- ability that bin 1 obtains a monopoly when bin 1 starts

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

... conditions are equivalent. There are two different generalizations of Sturmian sequences for alphabets of cardinality k ≥ 3. A natural generalization of Sturmian sequences is the set of infinite episturmian sequences.

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