Báo cáo toán học: "Plethysm for wreath products and homology of sub-posets of Dowling lattices" pptx

Báo cáo toán học: "Plethysm for wreath products and homology of sub-posets of Dowling lattices" pptx

Báo cáo toán học: "Plethysm for wreath products and homology of sub-posets of Dowling lattices" pptx

... journal of combinatorics 13 (2006), #R87 7 Plethysm for wreath products and homology of sub-posets of Dowling lattices Anthony Henderson ∗ School of Mathematics and Statistics University of Sydney, ... analogues for sub-posets of the Dowling lattices of the results of Calder- bank, Hanlon, and Robinson on homology of sub-posets of the partition...

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

25 203 0
Báo cáo toán học: " System for fast lexical and phonetic spoken term detection in a Czech cultural heritage archive" docx

Báo cáo toán học: " System for fast lexical and phonetic spoken term detection in a Czech cultural heritage archive" docx

... Czech languageisaconsiderabledifferencebetweenthewrit- ten form of the language (Standard or Literary Czech) and the spoken form (Common Czech). This difference occurs not onl y on t he lexical level (usage of German- isms and Anglicisms), ... 52,000 interviews of 32 languages, a total of 116,000 h of video. About half of the collection is in English, and about 4,000 of En...

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

11 377 0
Báo cáo toán học: "On the determining number and the metric dimension of graphs" pot

Báo cáo toán học: "On the determining number and the metric dimension of graphs" pot

... consists of all subtrees T x of T for which there exists a tree T x ′ isomorphic to T x where x = x ′ and such that x and x ′ have the same parent. Let T 0 denote the set T x of elements of T for ... problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of tre...

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

20 304 0
Báo cáo toán học: "Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs" ppsx

Báo cáo toán học: "Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs" ppsx

... (c). This concludes the proof of Key Lemma 1. Acknowledgment: We would like to thank Tibor Szab´o and Emo Welzl for suggest- ing such a rich and b eautiful topic and also for the numerous helpful ... . , s l ) we let sum(s) and num = 1 (s) denote the sum of the s i (we interpret 3 ′ and 3 ′′ as 3), and the number of s i different from 1, respectively. For insta nce, f...

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

28 452 0
Báo cáo toán học: " Inequalities for convex and s-convex functions on Delta=[a,b]x[c,d]" potx

Báo cáo toán học: " Inequalities for convex and s-convex functions on Delta=[a,b]x[c,d]" potx

... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/instructions/ For information ... contributions HK, AOA and MA carried out the design of the study and performed the analysis. MEO (adviser) participated in its design and coordination. All authors read and appro...

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

26 402 1
Báo cáo toán học: " Criteria for robustness of heteroclinic cycles in neural microcircuits" potx

Báo cáo toán học: " Criteria for robustness of heteroclinic cycles in neural microcircuits" potx

... discussion of WLC and related phenomena. This has focused on the dynamics of Lotka–Volterra type models for firing rates, justified by an approximation of Fukai and Tanaka [26]. In their most general form, ... part of P i } is dynamically invariant for all ODEs in that class. For a given symmetry or coupling structure, we identify a list of possible cluster states and use...

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

28 306 0
Báo cáo toán học: "BIJECTIONS FOR HOOK PAIR IDENTITIES." potx

Báo cáo toán học: "BIJECTIONS FOR HOOK PAIR IDENTITIES." potx

... write HP G (H) for the multiset of hook pairs of the cells of H measured inside G, i.e., arm length and leg length are taken with respect to the boundaries of G (and not with respect to the boundaries of ... HP SQ(a,µ) (A 2 ). 3. The “master bijection” — Proof of Theorem 1. It is obvious that for a proof of Theorem 1 it suffices to consider just those cells c of SR n,k (µ...

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

13 213 0
Báo cáo toán học: " Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers" potx

Báo cáo toán học: " Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers" potx

... electronic journal of combinatorics 7 (2000), #R32 3 In a later section we will give exact values of D 5 (n) for many values of n. These values and other studies described later for partitions into ... the last paragraph for 160 is similar to what happens for the largest partitions into 4 and 3 sets; further evidence that 160 may be maximal for 5 set partitions. For part...

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

9 291 0
w