Báo cáo toán học: "Closed Weak Supplemented Modules" pps

... alt =""

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

...

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

... C + 0 (R d ). In comparison with the notion of the weak topology, we have the following proposition. Proposition 3.9. Theconvergenceintheweaktopologyandtheweakconver- gence are equivalent. Proof. Let ... T ∈C. Similarly The Weak Topology on the Space of Probability Capacities in R d 243 3. The Weak Topology on the Space of Probabilitiy Capaciti...

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

... modules are weak supplemented, hence closed weak supplemented. So we have the following implications: local ⇒ hollow ⇒ weak supplemented ⇒ closed weak supplemented. But a closed weak supplemented ... M closed weak supple- mented and N non-singular. Then N is closed weak supplemented. 4. Cl osed Weak Supplemented Ring AringR is called closed weak supplemented i...

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

... right modules whose objects are submodules of M -generated modules. A module N ∈ σ[M]issaidtobeM -small if there exists a module L ∈ σ[M] such that N  L. Let M be a module. If N and L are submodules ... of all M-small modules. They call N an M-cosingular (non -M-cosingular) module if Z(N)=0(Z(N)=N). Clearly every M -small module is M -cosingular. The class of all M-cosingular mo...

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

... Between Weakly d-Koszul Modules and Classical d-Koszul and Koszul Modules In this section, we will investigate the relations between weakly d-Koszul modules and classical d-Koszul and Koszul modules. ... among weakly d-Koszul modules, d-Koszul modules and Koszul modules. Corollary 3.10. Let M be a weakly d-Koszul module. Then (1) All the 2n th syzygies of G(M...

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

... square-counting or an interlacing argument, one can show that the max- imum number of vertices in an independent set in the Hoffman-Singleton graph is 15. If S is an independent set of size 15 in this ... Then H is the Hoffman-Singleton graph. Note that we may view the vertices in S as points and the vertices not in S as lines, with a point and line incident if the corresponding verti...

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

... with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973), 268–277. [13] Wilf H S: private communication, 1995. Priority Queues and Multisets M.D. ... Linton L.A. Walker Department of Mathematical and Computational Sciences University of St. Andrews North Haugh, St. Andrews KY16 9SS, Scotland {sal,mda,louise}@dcs.st -and. ac.uk Subm...

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

... A planar mixed hypergraph may not have a strong embedding. We prove an easy lemma on the number of faces of size two in an embedding of a planar mixed hypergraph: Lemma 1 Let H be any planar mixed ... of planar mixed hypergraphs — similar properties of planar mixed hypergraphs were already used in [10, 15]. We address properties of feasible sets and existence of strict col...

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

... 3 q }. This coloring is easy to show not to have any rainbow arithmetic progressions of length at least 3. It turns out that in order to force a rainbow AP(k) we need to ensure that for each color ... A 5 and i is odd, C otherwise. (4) the electronic journal of combinatorics 11 (2004), #R1 6 On rainbow arithmetic progressions Maria Axenovich Department of Mathematics Iowa State Uni...

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

... symbol of σ.Sincen +1>m, we can select a random subsequence of σ of length m by first throwing out one of the n + 1 symbols of σ at random and then randomly selecting a subsequence of length ... the following theorem of Stromquist. We give a proof which is somewhat shorter than the proof in [1], both for its own interest and because we will reuse the method of proof when stu...

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

... ∈ M k (p)andq is obtained from p by deleting i − 2 entries from 1, ,i− 1 and not deleting i}, B = {q | q ∈ M k (p)andq is obtained from p by deleting i − 2 entries from 1, ,i− 1andi}, C = {q ... paper develops in three main directions – permutation reconstruction from multisets and sets of minors as well as permutation reconstruction from sets of minors within certain classes...

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

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

... 05A05, 05C30 Abstract We show that matchings avoiding a certain partial pattern are counted by the 3- Catalan numbers. We give a characterization of 12312 -avoiding matchings in terms of restrictions ... decompose a 12312 -avoiding matching into smaller 12312 -avoiding matchings. For notational convenience, we denote by E j the edge (i, j) with i < j. Lemma 2.1 Let M be a 12312 -avo...

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

... journal of combinatorics 15 (2008), #R111 10 On the S n -modules generated by partitions of a given shape Daniel Kane 1 and Steven Sivek 2 1 Department of Mathematics, Harvard University dankane@math.harvard.edu 2 Department ... 2008 Mathematics Subject Classification: 05E10 Abstract Given a Young diagram λ and the set H λ of partitions of {1, 2, . . . , |λ|} of...

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