Báo cáo toán học: "A Short Proof of the Rook Reciprocity" pps

Báo cáo toán học: "A Short Proof of the Rook Reciprocity" pps

Báo cáo toán học: "A Short Proof of the Rook Reciprocity" pps

... second coordinate (i.e., the number of ways of “placing k non-taking rooks on B”). It has long been known [5] that the rook numbers of a board B determine the rook numbers of the complementary board ... subset of [d] × [d](where[d]isdefinedtobe{1, 2, ,d})andtherook numbers r B k of a board are the number of subsets of B of size k such that no two elements have...
Ngày tải lên : 07/08/2014, 06:20
  • 2
  • 349
  • 0
Báo cáo toán học: "A short proof of a partition relation for triples" pdf

Báo cáo toán học: "A short proof of a partition relation for triples" pdf

... A short proof The following theorem first appeared in [3, Theorem 31, pp. 447–457]. (Actually, this is not quite true. The theorem there was claimed only for uncountable orders into which neither ... [X] 4 exists. In the light of Theorems 2 and 3, a positive resolution of the following question would be the best improvement of Theorem 1 possible. Question 1. If X is an orde...
Ngày tải lên : 07/08/2014, 06:20
  • 9
  • 343
  • 0
Báo cáo toán học: "A short proof of a theorem of Kano and Yu on factors in regular graphs" pot

Báo cáo toán học: "A short proof of a theorem of Kano and Yu on factors in regular graphs" pot

... 1)-factor of G avoiding e, then G − E(F 2k+1 ) is a (2m − (2k + 1))- factor containing e, and the proof is complete. Corollary 2 (Kano and Yu [1] 2005) Let G be a connected r-regular graph of even order. ... edge e of G, G has a 1-factor containing e, then G has a k-factor containing e and another k-factor avoiding e for all integers k with 1 ≤ k ≤ r − 1. The following example wil...
Ngày tải lên : 07/08/2014, 13:21
  • 2
  • 320
  • 0
Báo cáo toán học: "A short proof for the number of permutations containing pattern 321 exactly once" ppt

Báo cáo toán học: "A short proof for the number of permutations containing pattern 321 exactly once" ppt

... exactly once. In this paper, we give a short proof for the result of Noonan [3] that the number of permutations of length n containing exactly one occurence of pattern 321 is 3 n  2n n−3  . (To ... A short proof for the number of permutations containing pattern 321 exactly once Alexander Burstein Department of Mathematics Howard University Washington, ... Aug 23, 2...
Ngày tải lên : 08/08/2014, 14:23
  • 3
  • 273
  • 0
Báo cáo toán học: "A Concise Proof of the Littlewood-Richardson Rule" pdf

Báo cáo toán học: "A Concise Proof of the Littlewood-Richardson Rule" pdf

... extension of the Littlewood-Richardson rule [Z]. Taking the specialization λ = , we obtain the decomposition of s µ/ν into Schur functions; it is simpler than the traditional formulation of the Littlewood-Richardson rule ... b i free k + 1’s in row i of T , then there should be b i free k’s and a i free k + 1’s in row i of σ k (T ). In the following, T ≥j denotes the s...
Ngày tải lên : 07/08/2014, 06:23
  • 4
  • 253
  • 0
Báo cáo toán học: "A Combinatorial Proof of the Sum of q-Cubes" pptx

Báo cáo toán học: "A Combinatorial Proof of the Sum of q-Cubes" pptx

... number of boxes in the first row is equal to the size of the first part, the number of boxes in the second row is equal to the size of the second part, etc. For example, the Ferrers diagram for the ... that the set S consists of pairs of partitions with no primed parts. In the definition of φ −1 when there is a primed integer in the image, we consider only...
Ngày tải lên : 07/08/2014, 08:20
  • 6
  • 299
  • 1
Báo cáo toán học: "A positive proof of the Littlewood-Richardson rule using the octahedron recurrence" pot

Báo cáo toán học: "A positive proof of the Littlewood-Richardson rule using the octahedron recurrence" pot

... of the hive give λ • the differences on the Northeast side of the hive give µ • the differences on the South side of the hive give ν where all differences are computed left-to-right throughout the ... vertex. The constant coordinate assigned is then the label on ∆ counterclockwise of the extra vertex, minus the label on ∆ clockwise of the extra vertex. The v...
Ngày tải lên : 07/08/2014, 08:20
  • 18
  • 201
  • 0
Báo cáo toán học: "A Combinatorial Proof of the Log-concavity of a famous sequence counting permutations" potx

Báo cáo toán học: "A Combinatorial Proof of the Log-concavity of a famous sequence counting permutations" potx

... me to the area of log-concave sequences. Abstract We provide a combinatorial proof for the fact that for any fixed n, the sequence {i(n, k )} 0≤k ≤ ( n 2 ) of the numbers of permutations of length ... i(p) of inversions, and the study of numbers i(n, k)ofn-permutations having k inversions, is a classic area of combinatorics. The best-known result is the following...
Ngày tải lên : 07/08/2014, 08:22
  • 4
  • 227
  • 0
Báo cáo toán học: "A Simple Proof of the Aztec Diamond Theorem" potx

Báo cáo toán học: "A Simple Proof of the Aztec Diamond Theorem" potx

... 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 ... Kirkland [2] give a proof by considering a matrix of order n(n +1) the determinant of which gives a n . Their proof is reduced to the computation of the dete...
Ngày tải lên : 07/08/2014, 08:22
  • 8
  • 408
  • 0

Xem thêm

Từ khóa: