Báo cáo toán học: "A triple lacunary generating function for Hermite polynomials" pps

Báo cáo toán học: "An Extension of Uniqueness Theorems for Meromorphic Mappings" pps

Báo cáo toán học: "An Extension of Uniqueness Theorems for Meromorphic Mappings" pps

... Dethloff and Tran Van Tan, Uniqueness problem for meromorphic mappings with truncated multiplicities and moving targets, Nagoya Math. J. (to appear). An Extension of Uniqueness Theorems 83 dim  z ... v (f,H) ). Sometimes we write N k) f (r, H )forN k) 1,f (r, H ), N l,f (r, H )forN +∞) l,f (r, H )and N f (r, H )forN +∞) +∞,f (r, H ). An Extension of Uniqueness Theorems...

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

24 335 0
Báo cáo toán học: " A Blowing-up Characterization of Pseudo Buchsbaum Modules" ppsx

Báo cáo toán học: " A Blowing-up Characterization of Pseudo Buchsbaum Modules" ppsx

... a Buchsbaum  A- module by Proposition 1 and Theorem 3. Thus  M/  N is a pseudo Buchsbaum Vietnam Journal of Mathematics 34:4 (2006) 449–458 A Blowing-up Characterization of Pseudo Buchsbaum ... all parameter ideals q of M. We also show that the associated graded module G q (M) is pseudo Cohen Macaulay (resp. pseudo Buchsbaum) provided M is pseudo Cohen Ma...

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

10 296 0
Báo cáo toán học: "A note on random minimum length spanning trees" pps

Báo cáo toán học: "A note on random minimum length spanning trees" pps

... edge connected then the expected length of a minimum spanning tree is ∼ n r ζ(3). If we omit the edge connectivity condition, then it is at most ∼ n r (ζ(3) + 1). 1 Introduction Given a connected ... first give a rather precise description of mst(G). Lemma 1 [1] For any connected graph G, mst(G)=  1 p=0 E(κ(G p ))dp − 1. (3) A note on random minimum length spanning trees Al...

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

5 357 0
Báo cáo toán học: " Random walks on generating sets for finite groups" docx

Báo cáo toán học: " Random walks on generating sets for finite groups" docx

... 51–72. [6] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of group, Stanford Technical Report No. 481, July 1995, 36 pages. [7] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of abelian ... most c r n 2 log n where the constant c r depends only on the order r of G . 1. Introduction One method often used in computational group theory for generating...

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

14 330 0
Báo cáo toán học: "Affine Weyl groups as infinite permutations" pps

Báo cáo toán học: "Affine Weyl groups as infinite permutations" pps

... representations of the groups of type D,  B and  D. 3TheABCD-families of Weyl groups The classification of finite and affine Weyl groups (due to Coxeter in 1935) features the infinite families defined ... finite case is easy, and Eq. 1 has a straightforward combinatorial proof for each group. The affine case has been considered much harder. We will refer to Eq. (2) as Bott’s formula. I...

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

32 279 0
Báo cáo toán học: "A Multivariate Lagrange Inversion Formula for Asymptotic" pps

Báo cáo toán học: "A Multivariate Lagrange Inversion Formula for Asymptotic" pps

... a i,j . A traditional formulation of multivariate Lagrange inversion is Theorem 1. Suppose that g(x),f 1 (x),···,f d (x)are formal power series in x such that f i (0) = 0for 1 ≤ i ≤ d. Then the ... combinatorial proof of the multivariate Lagrange inversion formula, J. Combin. Theory Ser. A 45 (1987) 178–195. [5] I. P. Goulden and D. M. Kulkarni, Multivariable Lagrange invers,...

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

4 214 0
Báo cáo toán học: "A triple lacunary generating function for Hermite polynomials" pps

Báo cáo toán học: "A triple lacunary generating function for Hermite polynomials" pps

... identities and generating functions involving these polynomials. In this paper we apply Foata’s approach to generating functions for the Hermite polynomials to obtain a triple lacunary generating function. ... 4x)/(2x)is the Catalan generating function. We also give an umbral proof of this generating function. 1. Introduction The Hermite polynomials H n (u) may be defin...

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

14 191 0
Báo cáo toán học: "A Gessel–Viennot-Type Method for Cycle Systems in a Directed Graph" doc

Báo cáo toán học: "A Gessel–Viennot-Type Method for Cycle Systems in a Directed Graph" doc

... c i intersects a walk c χ β at v i and no walk at w k+i . Case 2. c i intersects a walk c χ γ at w k+i and no walk at v i . Case 3. c i intersects a walk c χ β at v i and the same walk again at ... short) that is presented in Section 3.4. From the idea of a minimal permutation cycle, we define a minimal walk to have as its base permutation a minimal permutation cycle, and a m...

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

28 227 0
Báo cáo toán học: " A Combinatorial Derivation of the PASEP Stationary Stat" pps

Báo cáo toán học: " A Combinatorial Derivation of the PASEP Stationary Stat" pps

... define a larger Markov chain, the M -PASEP, which we use to study the stationary distribution of the original PASEP. In particular we show that the stationary distributions of the M -PASEP and the PASEP ... 2006 Mathematics Subject Classifications: 0 5A9 9, 60G10 Abstract We give a combinatorial derivation and interpretation of the weights associated with th...

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

23 276 0
Báo cáo toán học: "A note on palindromic δ-vectors for certain rational polytopes" pdf

Báo cáo toán học: "A note on palindromic δ-vectors for certain rational polytopes" pdf

... A note on palindromic δ-vectors for certain rational polytopes Matthew H. J. Fiset and Alexander M. Kasprzyk ∗ Department of Mathematics and Statistics University of New Brunswick Fredericton, ... function for L P can be written as a rational function: Ehr P (t) :=  m≥0 L P (m)t m = δ 0 + δ 1 t + . . . + δ k(n+1)−1 t k(n+1)−1 (1 − t k ) n+1 , whose coefficients δ i are non-ne...

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

4 195 0
Báo cáo toán học: "A uniform approach to complexes arising from forests" pps

Báo cáo toán học: "A uniform approach to complexes arising from forests" pps

... this paper we present a unifying approach to study the homotopy type of several complexes arising from forests. We show that this method applies uniformly to many complexes that have been extensively ... the concepts introduced in Section 3 to study simplicial complexes associated to forests. We shall see that all these complexes are grapes and are homotopic to wedges...

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

18 217 0
Báo cáo toán học: "A Note on Commuting Graphs for Symmetric Groups" potx

Báo cáo toán học: "A Note on Commuting Graphs for Symmetric Groups" potx

... Perkins and P. Rowley. Commuting Involution Graphs for Symmetric Groups, J. Algebra 266(2003), no. 1, 133-153. [2] C. Bates, D. Bundy, S. Perkins and P. Rowley. Commuting Involution Graphs in Finite ... encoded in x -graphs (see Lemma 2.3 and Proposition 3.6 in [1] for more de- tails). For further recent work on commuting graphs we direct the reader to [2], [3] and [4]....

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

13 263 0
Báo cáo toán học: "A q-analogue of de Finetti’s theorem" ppsx

Báo cáo toán học: "A q-analogue of de Finetti’s theorem" ppsx

... := ∞  i=1 ξ i η i , ξ ∈ V ∞ , η ∈ V ∞ , the electronic journal of combinatorics 16 (2009), #R78 14 A q-analogue of de Finetti’s theorem Alexander Gnedin Department of Mathematics Utrecht University the Netherlands A.V.Gnedin@uu.nl Grigori ... the prod- uct topology of the space of functions on Γ and has the property of uniqueness of the barycentric decomposition of eac...

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

16 275 0
Báo cáo toán học: "A Note on the First Occurrence of Strings" ppsx

Báo cáo toán học: "A Note on the First Occurrence of Strings" ppsx

... bit of one string is the complement bit of the corresponding bit of the other string. In this note, we further study the property of complement strings for three-person games. We prove that if the ... is clearly the complement string of σ 2 = 11 . . . 10. the electronic journal of combinatorics 17 (2010), #N5 2 A Note on the First Occurrence of Strings...

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

8 431 0
Báo cáo toán học: "A strengthening of Brooks’ Theorem for line graphs" doc

Báo cáo toán học: "A strengthening of Brooks’ Theorem for line graphs" doc

... another proof of the following result (see [14] for the original proof and [17] for further r emarks and a different proof). Theorem 3 (King, Reed and Vetta [14]). If G is the line graph of a multigraph, ... of G, respectively. Thus Brooks’ Theorem holds for line graphs of multigraphs in much stronger form. Using similar methods we then prove that if G is th e line gr...

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

7 243 0
w