Báo cáo toán học: "he alternating sign matrix polytope" pps

... alt =""

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

... alt =""

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

... The Umbral Transfer-Matrix Method. IV. Counting Self- Avoiding Polygons and Walks, this article. [Z5] Doron Zeilberger, The Umbral Transfer-Matrix Method. V. The Goulden- Jackson Cluster Method ... F 2 (q). the electronic journal of combinatorics 8 (2001), #R28 16 The umbral transfer-matrix method IV. Counting self-avoiding polygons and walks Doron ZEILBER...

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

... two dimensions of turning games in Chapter 14 of Winning Ways. 2. The Rules of the Game. In this paper, another form of matrix nim is proposed. This form is also a gen- eralization of Wythoff’s Game, ... positions of the form  ab cd  with a =min{a, b, c, d}. Then all L-positions are of the form, a + c<min{b, d}. (7) All R-positions are of the form, a + b<min...

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

... (that is, locally). In a sense, the new theorem sits between the Local Theorem for Tilings and the so- called Extension Theorem; the latter, in turn, is based on the Local Theorem for Tilings and ... so there can only be a finite number of proper ascents in (2.2). 3 The Local Theorem for Monotypic Tilings The following Local Theorem for Monotypic Tilings is a com...

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

... eigenvalues, and showed that the eigenvalues that are neither dominant nor equal to 1 are o((log n) 2/5 ). Added in proof: our evaluation of the permanent of the original matrix of Redheffer, given in Theorem ... theoretic way, recall that an ordered factorization of an integer m is a representation m = a 1 a 2 a k ,inwhichalla i sare≥ 2 and the order of the f...

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

... the circular chromatic index of F 3 : Theorem 2. The circular chromatic index of F 3 is 7/2. Proof. A 7/2 -circular edge-coloring of F 3 can be found in Figure 2. By Theorem 1, the cir- cular chromatic ... edges e and f of G. The circular chromatic index of G is the infimum (in fact, the minimum) of all r > 0 such that G has an r -circular edge-coloring. Th...

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

... DS(n), the polytope of degree sequences, to be the convex hull (in R n )ofall degree sequences in DS(n) and define DP(n), the polytope of degree partitions,tobethe convex hull of all degree partitions ... inequality description of the degree sequence polytope yields a linear inequality description of the degree partition polytope and we show that the extreme point...

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

... when successful, generates an incidence matrix uniformly at random from all incidence matrices. The probability of success can be estimated and the asymptotic formula for F 1111 (n) results. Let ... 0’s uniformly at random. (iii) Delete all rows and columns for which all entries are 0. Proof Denote a 0-1 matrix with k rows, l columns, and n 1’s a (k, l) -matrix. Denote an inciden...

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

... regular graph and e be an edge of G. If H is a component of G e with à (H) = à (G e) , then à (G) µ (H) > 1 Diam (H) |H| . This lemma follows easily from Theorem 2.1 of [2] and its proof ... its proof is omitted. Proofs Proof of Theorem 2 Write dist F (s, t) for the length of a shortest path joining two vertices s and t in a graph F. Write d for the degree of G, let H = G uv,...

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

... avoidance and longest increasing subsequences by deriving the limiting distribution of the longest increasing subsequences in τ-avoiding permutations, for each of the possible τ ∈ S 3 . Inspired by the ... distribution. Note that we are considering alternating subsequences starting with a fall”. The alternative of alternating subsequences starting with a rise” would yield the same...

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

... (4) where u g ∼ K . = 0.1034 is a constant. 2 Cubic Maps A map is called cubic if all its vertices have degree 3. The dual of cubic maps are called triangular maps whose faces all have degree ... families. Richmond and Wormald [5] showed that many families of unrooted maps have asymptotics that differ from the rooted asymptotics by a factor of four times the number of edges. See Goulde...

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

... the alternating sign matrix polytope in terms of inequalities and then proving that the vertices are the alternating sign matrices. Theorem 2.1. The conv ex hull of n ì n a l terna ting sign ... convex combination of alternating sign matrices (i.e. matrices of P (n) with no inner partial sums). 3 Properties of the ASM polytope Now that we can describe the alternating sign...

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

... of combinatorics 16 (2009), #R73 32 Graphs and Rules. We work with simple digraphs, which we represent as (M, V ) where M is a Boolean matrix for edges (the graph adjacency matrix) and V a Boolean ... Boolean complexes and relates operations on graphs with operations on Boolean complexes. Section 5 studies coherence of sequences of productions and Section 6 initial dig...

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

... exp(− ¯ d min /(2C)), the electronic journal of combinatorics 16 (2009), #R138 44 The spectral gap of random graphs with given expected degrees ∗ Amin Coja-Oghlan University of Edinburgh, School of Informatics Crichton ... graphs with with given degree sequences. Random Structures and Algorithms 32 (2008) 1–19 [7] Chung, F., Lu, L.: Connected components in rand...

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