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

... class="bi x0 y0 w2 h 2" alt =""

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

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

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

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

... Sperner partition system in P ck k is a uniform partition system. the electronic journal of combinatorics 12 (2005), #N20 4 A Sperner-Type Theorem for Set-Partition Systems Karen Meagher Department ... k-partition system of an n-set for any k and n. 1 Introduction In this paper, we prove a Sperner-type theorem for systems of set partitions and re- lated results. These theorem...

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

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

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

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

... := ∞  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

... between  W S and affine partitions, there are three natural partial orders on affine partitions. Bruhat order and the left weak order on  W S are inherited from  W . Thus, the affine partitions also ... C i,j C k,l is reduced and in  W S if and on l y if a t least one of the following hold: 1. i < k and j < l. 2. k + l > n and i < k and j ≤ l. 3. i + j > n...

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

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

... between  W S and affine partitions, there are three natural partial orders on affine partitions. Bruhat order and the left weak order on  W S are inherited from  W . Thus, the affine partitions also ... C i,j C k,l is reduced and in  W S if and on l y if a t least one of the following hold: 1. i < k and j < l. 2. k + l > n and i < k and j ≤ l. 3. i + j > n...

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

... 05C05 60C05 Abstract By a theorem of Dobrow and Smythe, the depth of the kth no de in very simple families of increasing trees (which includes, among others, binary increasing trees, recursive trees ... Dobrow/Smythe, Theorem 6) In a random increasing tree with n nodes from a simple family, the distribution of the distance between nodes i and k (i < k) is the...

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

... u s,s , are algebraic over F (z). the electronic journal of combinatorics 18 (2011), #P5 3 Generating functions attached to some infinite matrices Paul Monsky Brandeis University Waltham MA 02454-9110, ... automorphism of the splitting field that is the id e ntity on F (z) a nd permutes the roots that hav e positive ord among themselves. The goal of this section is to show that so...

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

... 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 be precise, Noonan considered permutations ... A short proof for the number of permutations containing pattern 321 exactly once Alexander Burstein Department of Mathematics Howard...

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