Báo cáo toán học: "Random Matrices, Magic Squares and Matching Polynomia" ppt

... as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Random approximation with weak contraction random operators and a random fixed point ... the fixed points of random maps. Choudhury [8], Park [9], Schu [10], and Choud- 2 Random approximation with weak contrac- tion random operators and a...

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

... class="bi x0 y3 w1 h 4" alt =""

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

... class="bi x0 y0 w4 h 2" alt =""

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

... result of Kannan, Tetali and Vempala to com- pletely solve, via a simple proof, the problem of random generation of a labeled tournament with a given score vector. The proof uses the method of path ... vector of a tournament is the sequence of out- degrees of the vertices of the tournament. In general, given a score vector with n scores, there can be an exponential (in n) nu...

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

... 51–72. [6] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of group, Stanford Technical Report No. 481, July 1995, 36 pages. [7] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of abelian ... most c r n 2 log n where the constant c r depends only on the order r of G . 1. Introduction One method often used in computational group theory for generating...

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

... 11−             =  c 1 c 2 c 3 c 4 c 5 c 6 c 7 c 8  the electronic journal of combinatorics 8 (2001), #R1 3 Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Anthony Bonato Department of Mathematics, Wilfrid ... graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with...

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

... journal of combinatorics 11 (2004), #R62 3 Random Cayley graphs are expanders: a simple proof of the Alon–Roichman theorem ZEPH LANDAU Department of Mathematics City College of New York landau@sci.ccny.cuny.edu A LEXANDER ... it establishes the result above with a smaller constant c ε . 1 Introduction A beautiful theorem of N. Alon and Y. Roichman [4] asse...

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

... graph and let p(G) be the total number of matchings in G.LetX be the random variable whose value is the number of edges in a randomly chosen matching; denote by m(G) its mean and by σ(G) its standard ... the critical line were computed and the following result was proved. the electronic journal of combinatorics 11(2) (2004), #R2 8 Random Matrices, Magic Squares and Matching...

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

... Introduction Droste and Kuske [4] have studied several random processes for producing a linear ordering ≺ on the set N of positive integers. In contrast to random graphs [2] and similar structures, random orders ... Random Orders and Gambler’s Ruin Andreas Blass ∗ Mathematics Department University of Michigan Ann Arbor, MI 48109–1109 U.S.A. ablass@umich.edu G´abor ... in the rando...

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

... R → and R ↓ of R ← and of R ↑ , respectively. We successively apply these inverse operations to the equation R ← (P ) = R ↑ (Q), and by commutation of R → and R ↓ (which follows that of R ← and ... reversing the order of the rows of M. As for the matrix P of 3.1.3(2), we have seen above that it is the integral encoding of the rectification S of any tableau T of...

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

... coin sets. Finally, we ask about the asymptotics of the density of the set of totally greedy coin sets within the set of greedy coin sets. If G(k, R) denotes the set of all greedy coin sets with ... easy to test if a coin set is totally greedy. We begin to explore the theory of greedy obstructions– those coin sets that cannot be extended to greedy coin sets...

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

... red line and a green line) and take the form x i − y j , where i is the row number and j the column number, both counted starting from the corner. The final representation is a semi-standard Young ... T free (u i ) and e (i) (x) =  j≥0 e (i) j x j for the time step corresponding to T free (v i ). h (i) j and e (i) j are the numbers of ways to move j steps to the left for a single gr...

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

... 2 Proofs The multiplicative magic squares can be described in terms of the additive ones in the following way: We write n A for the multiplicative magic square given by n A = n A(i,j) 1i,jr . If ... additive -multiplicative magic squares of order r = 5 with distinct entries? We have seen that the answer is negative for r = 4. On the contrary, Horner [4] found an additive and mul...

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

... electronic journal of combinatorics 17 (2010), #R117 9 [4] A. Brandt, A generalization of a combinatoria l theorem of Sparre Andersen about sums of random variables, Math. Scand. 9 (1961), 352-358. [5] ... properties of cyclic permu- tations of r. In Section 3, we consider more general cases. 2 Properties of cyclic permutations of a sequence In this section, we study pro p...

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

... electronic journal of combinatorics 18 (2011), #P85 6 2 Cubic planar hypohamiltonian graphs on 70 and 88 vertices In this section we present our cubic planar hypohamiltonian graphs on 70 and 88 ... 0- and 1-faces together non-2-faces. Claim 2.1. A cubic planar hypohamiltonian graph has at least three non-2-faces. Proof. Let D be an arbitrary cubic planar hypo...

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