Báo cáo toán học: "Lattice path proofs of extended Bressoud-Wei and Koike skew Schur function identities" pdf

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

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

... alt =""

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

... study the continuity of Julia set of some rational maps and the stability of the Hausdorff dimension of the Julia set of polynomials z d + c (d ≥ 2)forsome semi-hyperbolic parameters c in the boundary ... Vietnam Journal of Mathematics 33:3 (2005) 283–289 On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials Zhuang Wei Institu...

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

... g n is divisible by 5 if and only if (4 n − 1)  2n n  is divisible by 5. And since g n is odd, g n mod 10 = 5 if and only if g n is divisible by 5. 4 n −1 is divisible by 5 if and only if n is ... +( 1 4 ) 2  4 2  5 2 z 2 +···]. Hence, f n = 1 4 n  i= 0  2i i  2n − 2i n − i  5 i , and g n = 1 4 n  i= 0  2i i  2n − 2i n...

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

... obtain  1 N (ξ)= d  j=1 sin πξ j πξ j − F(ξ) d  j=1 sin πδ j ξ j πξ j , (11) lattice tilings by cubes: whole, notched and extended Mihail Kolountzakis Department of Mathematics 1409 W. Green St., University ... (11)). We find all the tilings discovered by Stein, which, by a deeper theorem of Schmerl [Sch], is the complete list of possible translational tilings (lattice...

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

... n)k −1 φ(k). In either case, the inequality in part 1 of the lemma holds. On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs Alan Frieze ∗ Department of Mathematical ... of combinatorics 7 (2000), #R57 4 3 Hamilton Cycles A Hamilton cycle is the union of two perfect matchings and so h(G) ≤ 1 2 m(G) 2 a...

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

... 1-factors of G. This gives a decomposition of the edges of G into 2r 1-factors of G,a(k + 1) -regular simple graph, and (r − 1) k -regular simple graphs. 3 1-factorization of regular multigraphs of even ... , r 2  are Hamilton cycles of G, F 1 ,F 2 , ,F (r−1) are 1-factors of G, F is a simple (k +1)-factor of G,andS 1 ,S 2 , ,S (r−1) are k -regular simple...

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

... orbits of Singer groups or subgroups of Singer groups. It seems, however, that only point (and, in the case the electronic journal of combinatorics 9 (2002), #R15 8 orbits of any Singer cycle of Σ n−1 on ... In the statement of the following theorem, à denotes the Măobius function, the basic properties of which can be found in, for example, [1]. Theore...

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

... x and y to be row and column sums of a matrix is that they have the same weight. Clearly, the row sums of a member of M are at most n.Conversely,ifx =(x 1 , ,x m ) and 0 x i n,letR = R(x)bethem ... (5) the electronic journal of combinatorics 13 (2006), #N8 5 3 Start of the proof Let N = {0, 1, }. Define the weight of a matrix N to be the sum of its e...

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

... 417–420. the electronic journal of combinatorics 15 (2008), #N36 5 Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs Terry A. McKee Department of Mathematics & Statistics Wright ... H is an induced subgraph of G and so has an even number of hamiltonian cycles. Suppose v  is the twin of some v ∈ V (G). If v  ∈ V (H), then H has an...

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

... p l } and we join vertices x and the electronic journal of combinatorics 15 (2008), #R126 10 The Ramsey number of diamond-matchings and loose cycles in hypergraphs Andr´as Gy´arf´as ∗ Computer and ... [12]) and t = 2 (Alon and Frankl [1] and Gy´arf´as [13]). Next we state and prove the Ramsey- type form of our main result, it determines the exact value of...

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

... =  u,v c u,v is the sum of the cofactors of q D G . Proof: We recall that qD G is the q-analogue of the distance matrix D G = (d u,v ) of G and qCOF G = (c u,v ) is the cofactor matrix of qD G . For two ... prove the following q-analogue of Graham, Hoffman and Hosoya’s result. Theorem 2 Let G be a strongly connected digraphwith distance matrix D G . Let the q-analo...

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

... (−1) m q (3m 2 +m)/2 c 2 , the electronic journal of combinatorics 17 (2010), #R116 2 Two Simple Proofs of Winquist’s Identity Chutchai Nupet Department of Mathematics Faculty of Science, Pr ince of Songkla University Hatyai, ... Classifi cation: 11F20, 11F27 Abstract We give two new proofs of Winquist’s identity. In the first pro of, we u se basic properties of cu...

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

... determinantal results of Bressoud and Wei, and of Koike. The proofs in that paper were algebraic. The present paper contains combinatorial lattice path proofs. Keywords: Schur functions, lattice paths 1 Introduction Our ... be the set of semistandard Young ta bleaux of shape λ and, similarly, T λ/σ (m) be the set of semistandard Young tableaux of skew shape λ/σ. Fo...

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