Báo cáo toán học: "A description of invariant subspaces of C 11-contractions " pptx

... h 3" alt =""

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

...

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

... SF n k, the number of (k, )-sum-free subsets of [1,n]. Since the set of 1 the electronic journal of combinatorics 7 (2000), #R30 7 Proof. We need to show that the left-hand side of (4) is not larger ... sets, Combinatorica 18 (1998), 449– 459. [3]N.J.Calkin,On the number of sum-free sets, Bull. Lond. Math. Soc. 22 (1990), 141–144. [4] N. J. Calkin, A. C. Taylor: Counting sets...

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

... ranks of set-inclusion matrices D. de Caen Department of Mathematics and Statistics Queen’s University Kingston, Ontario, Canada K7L 3N6 decaen@mast.queensu.ca Submitted: June 11, 2001; Accepted: ... Accepted: June 16, 2001 Abstract A recurrence relation is derived for the rank (over most fields) of the set-inclusion matrices on a finite ground set. Given a finite set X of say v elements...

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

... Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel email: raphy@research.haifa.ac.il Submitted: November 17, 2001; Accepted: March 21, 2002. MR Subject Classifications: 0 5C2 0, ... specifying conditions on the cardinality of the edge-set of the digraph that guarantee the existence of a directed simple cycle of length at most four. As usual in Tur´an...

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

... number of cycles violate (b) because the parity of the number of cycles in the structure D chosen there must be opposite the parity of |S| so that the final structure will have an odd number of cycles. ... family of structures is Poisson with parameters C and λ = C . the electronic journal of combinatorics 10 (2003), #R15 4 Example 4 Permutations with Restricted Cycle Lengths....

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

... acdf; q) n (ac, cf; q) n+1 (q 2 /bcde; q) n q n = d (q,qd /c, c/d,abcd,acdf,bcdf,acde,cdef,bcde/q; q) ∞ (ac,ad,cf,df,bc,bd,ce,de,abc 2 d 2 ef/q; q) ∞ . (13) The proof is completed. References [1] G.E.Andrews,Ramanujan’s ... d (q,qd /c, c/d,acdf,abcd,bcdf,acde,cdef; q) ∞ (ac,ad,cf,df,abc 2 d 2 ef/q; q) ∞ . (12) Henceweget d ∞  n=0 (q/bc, q/ce, acdf; q) n (ad, df; q) n+1 (q 2 /bcde; q) n q n −...

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

... (y ij ) 1≤i,j≤2n . Recently there appeared a bijective proof of Borchardt’s identity (see [13]). It will be an interesting problem to give a bijective proof of (7) and (8). the electronic journal of combinatorics ... Japan ishikawa@fed.tottori-u.ac.jp Hiroyuki KAWAMUKO Faculty of Education, Mie University Tsu, Mie, Japan kawam@edu.mie-u.ac.jp Soichi OKADA Graduate School of Mathemat...

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

... electronic journal of combinatorics 12 (2005), #R4 16 correspondence for short. The R-S correspondence describes the irreducible decomposition of the representation of the group GL(n, C) on (C n ) ⊗f (where ... correspondence is a combinatorial construction devised by A. Berele in [B], as an Sp(2n, C) -analogue of one aspect of the Robinson-Schensted correspondence, or the R-S th...

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

... arXiv: math.AC/0505612. [3] C. Bonnaf´e and C. Hohlweg, Generalized descent algebra and construction of irre- ducible characters of hyperoctahedral groups, arXiv: math.CO/0409199 . [4] C O. Chow, Noncommutative ... quasisymmetric functions: Gessel’s quasisymmetric functions, Chow’s type B quasisymmetric functions, and Poirier’s signed quasisymmetric functions. In each case we use the...

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