Báo cáo toán học: "An Improvement to Mathon’s Cyclotomic Ramsey Colorings" pdf

... Journal of Combinatorics, #R35, 11(1) (2004), 24 pages, http://www.combinatorics.org. the electronic journal of combinatorics 16 (2009), #N1 5 An Improvement to Mathon’s Cyclotomic Ramsey Colorings Xiaodong ... led to several best known lower bounds for Ramsey numbers (cf. [4]). Higher order (m ≥ 3) cyclotomic relations beyond the basic H m p so far seem to be not much explo...

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

... 1]} This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. An introduction to 2-fuzzy n-normed ... vec- tors. Then, for any f 3 , . . . , f n−1 , Ψ( f 1 ) − Ψ(f 0 ), . . . , Ψ(f n−1 ) − Ψ(f 0 ) are linearly dependent. and λf = {(λx, µ) : (x, µ) ∈ f} where λ ∈ S. The linear space (X...

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

... recurrence, it is necessary to understand why A i (q)=q i−1 C i−1 (q)C n−i (q). Since a path in A i first touches the diagonal at (i, i), it must go from (0, 1) to (i − 1,i) without touching the diagonal ... been shown to be C i−1 and thus have weight C i−1 (q). To these paths, we must add the i − 1 squares just above the diagonal from (0, 0) to (i, i). Thus the part of the paths fro...

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

... of a “q -species,” defined to be a functor from the category of finite dimensional vector spaces over a finite field to the category of finite sets. 1 Definitions The combinatorial theory of species ... is a functor from a category of vector spaces to the category of sets, whereas a tensorial species is a functor in the opposite direction. First we recall the definition of a combinatorial spec...

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

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

... electronic journal of combinatorics 7 (2000), #N4 2 Theorem 1 For any graphs G and H, γ(G)γ(H) ≤ 2γ(G  H). Proof. Let D be a dominating set of G  H. It is sufficient to show that γ(G)γ(H) ≤ 2|D|. ... = u i or u is adjacent to u i . This partition of V (G) induces a partition {D 1 ,D 2 , ,D γ(G) } of D where D i =(Π i × V (H)) ∩ D. Let P i be the projection of D i onto H.Thatis, P i = {v |...

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

... the comp -to- comp movement. Although other approaches, such as direct movement, are feasible too, we win adhere to the comp -to- comp approach. Data from Spanish (Torrego 1984) also seem to support ... will be possible to render (1) directly into (2), by means of a rule like (3). (4) Jan zwom ge,oonlijk John used to swim (5) Jan zwom gewoonlijk graag John used to like to...

Ngày tải lên: 18/03/2014, 02:20

... example: (5a) She read a lot tonight. (5b) She always read a lot. (Or She used to read a lot.) Yet, such expressions are not easy to capture automatically. In order to use the information expressed ... data used in the experiments consisted of 23 stories split into a training set (14 stories) and a testing set (9 stories). Each clause of every story was annotated by the author of this p...

Ngày tải lên: 24/03/2014, 03:20

... Àe k XE tot J À 1 A k e k  ¼ e k J XE tot 1 A k e 2 k À XE tot Jð1 Àe k Þ þ 1 A k e k ð1 Àe k Þ  ¼ e k J XE tot 1 A k e 2 k ð1 Àe k Þ À 1 1 Àe k XE tot J  Finally we get: R J e j ¼ e k 1 Àe k J XE tot 1 A k e 2 k À ... e k Due to proportional redistribution, the relationship between E 00 j and E 0 j is E 00 j E tot þ E ¼ E 0 j E tot or e 00 j ¼ e 0 j Therefore, and e 0 k À e k ¼ E 0...

Ngày tải lên: 30/03/2014, 15:20

... specifically, a method has been implemented according to which instantaneous estimations are updated by taking into account existing (historical) information on the user. The process of developing ... autonomic computing. IEEE Comput. 36(1), 41–50 (2003). doi:10.1109/MC.2003.1160055 [2] R Thomas, D Friend, L DaSilva, A McKenzie, Cognitive networks: adaptation and learning to achieve...

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