Báo cáo toán học: "A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs" ppsx

... 769 A simple in vivo assay for measuring the efficiency of gene length-dependent processes in yeast mRNA biogenesis Macarena Morillo-Huesca, Manuela Vanti and Sebastia ´ n Cha ´ vez Departamento ... (2001) Mutations in the TATA-binding pro- tein, affecting transcriptional activation, show synthetic lethality with the TAF145 gene lacking the TAF N-te...

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

... important tool to study paramagnetic proteins Plastocyanin is a good model system to address features of paramagnetic copper proteins in terms of assignment strategy. Indeed, the previously available ... requi- ring a specific expertise in the field. The resulting 3D spectra are standard spectra that can be handled by any standard software for protein NMR data analysis. Keyw...

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

... respond- ing to some. The same reasoning is applicable to loga092de compared to base092de for German. 5 Related Work The decision of leaving a query without response is related to the system ability to measure ... also to study the number of times systems are deemed to be equivalent with respect to a certain measure, which reflects the discrimination power of that measure....

Ngày tải lên: 17/03/2014, 00:20

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

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

... 1996 Abstract A method for constructing cubic graphs with girths in the range 13 to 16 is described. The method is used to construct the smallest known cubic graphs for girths 14, 15 and 16. Introduction We ... JournalofGraphTheory,6, 1982, 1-22. A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16 Geoffrey Exoo Departm...

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 Sciences, Carnegie ... combinatorics 6 (1999), #R17 3 A partition satisfying the second criterion is called equitable. V 0 is called the exceptional class. Following [9], for every equitable partition P into k +1classes ... (ˆx + ) T Wˆy − ≥ ˆγ √ pq/4. (The proof for...

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

... 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 Applica...

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

... behavior of f(n, p, q) between the linear and quadratic orders of magnitude, so for q lin ≤ q ≤ q quad . In particular we show that that we can have at most log p values of q which give a linear ... denotes the parity of the natural number n,soitis1ifn is odd and 0 otherwise. 1.2 Edge colorings with at least q colors in every subset of p vertice...

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

... is the number of times the integer i occurs in the sequence T . Note that the sum of all b(i), 1 ≤ i ≤ n,isequaltol, the length of T . 3 A simple proof for the existence of exponentially balanced ... two, or are two successive powers of two. A proof for the existence of exponentially balanced Gray codes is derived. The proof is much sim- p...

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

... 1986. the electronic journal of combinatorics 12 (2005), #R18 8 Theorem 2.3 (Aztec diamond theorem) The number of domino tilings of the Aztec diamond of order n is 2 n(n+1)/2 . Remark: The proof of ... between domino tilings of an Aztec diamond and non- intersecting lattice paths, a simple proof of the Aztec diamond theorem is given by means of...

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

... Macdonald-Cherednik theory). For completeness sake, we first quickly recall [2] how one can use proposition 1 to deduce the classical fact concerning exponents and heights of roots. Let P denote ... form on the dual of the Cartan subalgebra and let s j ∈ W (j = 1 · · · n) be the simple reflection correponding to α j . We will prove proposition 1 by induction on ht β. If ht β = 1, β...

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

... Beissinger, who was the first to explore [1] combinatorial proofs using colored permutations, for their assistance. References [1] Janet Beissinger. Colorful proofs of generating function identities. ... follows for (π, f ) ∈ S n,A : If R (π,f) = ∅, let φ((π, f)) = (π, f). Otherwise, let (i, j) ∈ R (π,f) be minimal under the lexicographic ordering of R (π,f) . Let ˜π = (i, j)...

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

... we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers. Keywords: Binary tree; Ternary tree; Generalized ... bijection between for ests of colored ternary trees and forests of complete binary trees. Note that there are totally m + 3p vertices in a forest F of...

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

... transforms  G 1 into  G 2 and its length is at most d + 2(e − d) + d = 2e.  the electronic journal of combinatorics 17 (2010), #R66 7 A simple Havel–Hakimi type algorithm to realize graphical degree sequences ... realizability of a set of integers as degrees of the vertices of a simple g r aph. J. SIAM Appl. Math. 10 (1 962), 496–506. [7] S.L. Hakimi: On the...

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

... if i = N, π i if i = N. the electronic journal of combinatorics 18 (2011), #P28 15 A Combinatorial Formula for Orthogonal Idempotents in the 0-Hecke Algebra of the Symmetric Group Tom Denton Submitted: ... automorphism of the un- derlying graph of a Dynkin diagram induces an auto morphism of the Hecke algebra. For the Dynkin diagram of S N , ther...

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