Báo cáo toán học: "A simple bijection between binary trees and colored ternary trees" pot

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

... (v i,9 ,v i,12 ), (v i,10 ,v i,13 ), (v i,11 ,v i,13 ), and (v i,12 ,v i,13 ). And we let h 0 =1,h 1 = 11, h 2 =9,h 3 =19,h 4 =7,h 5 = 37, h 6 = 17, and h 7 = 13. If we also let n = 80, we have a trivalent ... JournalofGraphTheory,6, 1982, 1-22. A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16 Geoffrey Exoo Department of Mathematics and Computer Science...

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

... Alon, Duke, Lefmann, R¨odl and Yuster [1]. Subsequently, Frieze and Kannan [3, 4] gave a different version and extended it to deal with hypergraphs, (see also Czygrinow and R¨odl [2]). In this note, ... Koml´os and Simonovits [6]. It has many, many applications and we refer the reader to this excellent survey. The Regularity lemma is often used to prove the existence of certain obj...

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

... 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 it is revealed and ... Mathematical Magazine, 61:301–305, 1988. [4] A. Panholzer and H. Prodinger. Towards a more precise analysis of an algorithm to generate binary trees : A tutorial. The Computer...

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

... define a correspondence between SSYT’x and reverse SSYT’x of the same shape λ/µ and the same norm: ⇒  Given a SSYT P of shape λ/µ, produce a reverse SSYT Q of the same shape and thesamenormasfollows: Let ... the only possible violations of increase along rows and strict increase along columns in P can only involve e and the entries to its right and below. When the jeu de taquin...

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

... Sections 3 and 4 to the hyperoctahedral ar- rangement. Again, the two active mappings α and α 1 are equal, and equivalent to the classical bijection between permutations and increasing trees. The ... in the same way in p and in 1qa. Interestingly enough, it turns out that α is equivalent in a very simple way to a classical bijection between permutations and increasing...

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

... Zanten and I N. Suparta, “Totally balanced and exponentially balanced Gray codes”, Discrete Analysis and Operation Research, vol. 11, No. 4 (2004), pp. 81-98. (Russian Journal) [11] D.G. Wagner and ... n. By extending the method of Robinson and Cohn for the construction of Gray codes in [5], van Zanten and Suparta in [10] proved the conjecture of Wagner and West in positive sens...

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

... (2) Note that |Π 1 | = 2, and hence, by induction, assertions (i) and (ii) follow.  To prove the Aztec diamond theorem, we shall establish a bijection between Π n and the set of domino tilings ... a bijection 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 Hankel determinants of...

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

... three strong ligands of copper(II) (His39 and Cys83), for Asn40, whose HN group is directly involved in a hydrogen bond with the copper-bound Cys83 S c atom [45,101–103], and for Tyr82 and Glu84. ... providing 89%, 87% and 92% of the assignment of C a ,C b and N–H, respectively. With the above approach we can reach metal-to-nucleus distances of 7.2, 3.6, and 7.5 A ˚ , for H, C a...

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

... <p= q<∞ ,and0  β  ∞,thenMB s,β q,q = B s q,β and MF s,β q,q = F s q,β , standard Besov and Triebel-Lizorkin spaces respectively; see [22]. A Characterization of Morrey Type Besov and Triebel-Lizorkin ... and Triebel-Lizorkin spaces, which is a characterization of Morrey-type Besov and Triebel-Lizorkin spaces. Before stating it, we recall some notations and the definition of...

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