Báo cáo toán học: " Coloured generalised Young diagrams for affine Weyl-Coxeter groups" ppsx
... −2) for ∆ϑ and the values (−1, −1, 2, −2, 2) for ∆Σ. For g = A (2) 5 , each row comprises a sequence of 1 0 2 3 3 2 blocks. The details of this case are then as for the g = B (1) 3 case above. For ... Therefore, λ(1) = (0, 0, . . . , 0), and both F (1) and T (1) are trivial diagrams whose profiles coincide with the vertical axis. 2.4 Recursive generation of coloured diagrams Le...
Ngày tải lên: 07/08/2014, 15:22
... of the hook numbers for some special families of (fixed) skew -Young diagrams (Theorem1.2). The problem appeared in the study of the hook formula for various kinds of Young diagrams. The proof ... nonasymptotic proofs of these results. The problem appeared in the study of the hook formula for various kinds of Young diagrams. The proofs are based on properties of shifted Schur f...
Ngày tải lên: 07/08/2014, 06:20
... a forest of given size. Lemma 2 (i) An r-uniform hypergraph with at least r!(t − 1) r edges contains a forest with t edges. (ii) Let F be a 3-uniform hypergraph. Then either (a) F contains a forest ... [5] conjectured that for any t there is a constant C so that any r-uniform hypergraph with C r edges contains a sunflower with t edges. We can obtain a bound of this form for forests, indeed...
Ngày tải lên: 07/08/2014, 08:22
Báo cáo toán học: "Certificates of factorisation for a class of triangle-free graphs" docx
... factorisation for strongly non-clique-separable graphs exist. Acknowledgement We thank Yingying Wen for her help in translating [4]. References [1] G.H. Birkhoff. A determinant formula for the number ... combinatorics 16 (2009), #R75 8 Certificates of factorisation for a class of triangle-free graphs Kerri Morgan and Graham Farr Clayton School of Information Technology Monash University...
Ngày tải lên: 07/08/2014, 21:21
Báo cáo toán học: "Modular, k-noncrossing diagrams" pdf
... structures [8, 21, 22, 23] are in the language of diagrams exactly modular, 2-noncrossing diagrams. In [9, 10, 1 1, 13], various classes of k-noncrossing diagrams have been enumerated. However the approach ... enumerated. However the approach employed in these papers does not work for modular k-noncrossing diagrams. In contrast to the situation for RNA the electronic journal of comb...
Ngày tải lên: 08/08/2014, 12:22
Báo cáo toán học: " Highly selective fluorescent chemosensor for Zn2+ derived from inorganic-organic hybrid magnetic core/shell Fe3O4@SiO2 nanoparticles" pot
... hydroxide) under N 2 . The solution was mechanically stirred for 1 h at 20°C and then heated at 70°C for 1 h. The mixture was then stirred for 30 min at 90°C upon addition of citric acid (0.5 g/ml). ... the Fe 3 O 4 @SiO 2 NPs as estimated by different methods.
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Optimized spectrum sensing algorithms for cognitive LTE femtocells" pdf
... wavelet transform (FWT) algorithm in order to perform the coarse sensing stage and compare its performance against the fast Fourier transform (FFT)-based coarse detection in terms of both performance ... point FFT modules are used 1598520 computations for db2 FWT 3197040 computations for db4 FWT 1599488 computations for 256-point FFT 1797120 computations for 512-point FFT Abdelmonem e...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Existence of Positive Solutions for Nonlinear m-point Boundary Value Problems on Time Scales" doc
... 2.8. For u ∈ P, there holds u(t) ≥ t T u for t ∈ [0, T ]. Proof. For u ∈ P, we have u ∆∇ (t) ≤ 0, it follows that u ∆ (t) is non-increasing. Therefore, for 0 < t < T, u(t) − u(0) = t 0 u ∆ (s)∆s ... freely for any purposes (see copyright notice below). For information about publishing your research in Boundary Value Problems go to http://www.boundaryvalueproblems.com/aut...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: " Combined perception and control for timing in robotic music performances" ppt
... 7 rameters and seems to be particularly effective for generating realistic and human-like expressive musical performances, while being straightforward to implement. In some sense, we circumvent ... exact inference will not be tractable, therefore, one should resort to approximate inference schemata, as discussed, for example in Whiteley et al. [26]. As for the control system, it is also...
Ngày tải lên: 20/06/2014, 20:20