Báo cáo toán học: "( , 0)-Carter partitions, their crystal-theoretic behavior and generating function" pdf

... article, spectrum sensing is performed for an LTE signal in two stages; a coarse stage and a fine stage. Analgorithmisproposedthatusesthewaveletpacket transform algorithm to perform the coarse sensing ... survey of spectrum sensing algorithms for cognitive radio applications. IEEE Commun Surv Tutor. 11(1), 116–130 (2009) 18. Y Youn, H Jeon, J Hwan Choi, H Lee, Fast spectr...

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

... ad- dress configuration time ( ¯ T conf ), by simply consider- ing the two possible configuration situations: (i) there is on average multi-hop connectivity between the un- configured vehicle and the ... evaluated the config- uration time ¯ T conf under different traffic conditions and for different deployment configuration parame- ters. The traffic conditions are defined by the vehicu- lar density...

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

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. On generalized weakly directional contractions and approximate fixed point property with applications Fixed ... work is properly cited. On generalized weakly directional contractions and approximate fixed point property with applications Wei-Sh...

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

... set of appearance-based features, but also considers a feature Video analysis-based vehicle detection and tracking using an MCMC sampling framework Jon Arr´ospide ∗1 , Luis Salgado 1 and Marcos ... of the lane, w l , and the longitudinal safety distance, d s . In addition, the design parameters α x and α y are selected so that α x = 0.5 and α y = 0.5 whenever a v...

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

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

... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Semi-industrial production of methane from textile ... Generation of methane from textile desizing liquors. Eng Life Sci 10(4):293-296 Figure 1. Strategies for the reuse of sugar-containing textile desizing l...

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

... coordinates and leaving A col,s n invariant. By a calculation of the character of S n on the homology of the order complex of L A col , s n and using a formula of Orlik & Solomon [10] we are able ... Lie algebra homology, where it appears in a generic fiber of a projection of the braid arrangement. The study of the intersection lattice of th...

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

... σ θ ∈ θ, and by construction in both permutations there is an increasing chain starting at position 1, while the remaining values form a decreasing chain; in σ θ , however, the increasing chain is ... domain and codomain in this case, taking order-equivalent functions corresponds to “wrapping around” independently both in the domain and in the codomain (not necessarily by the s...

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

... journal of combinat orics 11(2) (2005), #R21 10 P -partitions and a multi-parameter Klyachko idempotent Peter McNamara Instituto Superior T´ecnico Departamento de Matem´atica Avenida Rovisco Pais 1049-001 ... definition naturally makes the Klyachko idem- potent appealing to combinatorialists and, for example, [2, 4, 11, 15] study the Klyachko idempotent and its generaliza...

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

... considered a set of partitions λ = (λ 1 ,λ 2 , ), λ 1 ≥ λ 2 ≥ , of an integer n with a fixed sum of even parts (i.e. λ 2 + λ 4 + ··· = m). They, in particular, proved that the number of such partitions ... of partitions (, à) such that ||+|à| = m. Their proof is based on construction of a bijection between the set of partitions of n with the sum of even parts being equal to m a...

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

... complexity of some concrete M-partition problems with small matrices M ; for instance if we consider M -partitions with lists, one such problem with m = 4 is described in [4]; see also [10, 25]. Each ... D  to part (row) 5. the electronic journal of combinatorics 14 (2007), #R58 9 Matrix Partitions with Finitely Many Obstructions Tom´as Feder ∗ , Pavol Hell † and Wing Xie ‡ S...

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

... partitions ((5 ), ( 4, 1 ), ( 3, 2 ), ( 3, 1, 1 ), ( 2, 2, 1)). Therefore, there are 5 such -partitions. They are: (2 1, 4, 2, 1, 1 ), (1 8, 7, 2, 1, 1 ), (1 5, 1 0, 2, 1, 1 ), (1 5, 7, 5, 1, 1 ), (1 2, 1 0, 5, 1, 1). ν ... ( 9, 4, 2, 1, 1) ≈ (( 2, 1, 1 ), 2, (1)). λ...

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

... à) and (n ||, ) are partitions for all n ≥ 2k since the hypotheses |à|, || k the electronic journal of combinatorics 16(2) (2009), #R19 20 Character Polynomials, their q-analogs and the Kronecker ... #R19 1 The c ,à, go by the name of Kronecker coeci ents and they may be interpreted as the multiplicity of the irreducible representation of S n indexed by λ in...

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

... follows. 3 Cyclic partitions of general complete hypergraphs By ˜ K n we denote the complete hyper gr aph on the set of vertices V n , i.e. the hypergraph with the set of edges consisting of all non ... the complete k -uniform hypergraph of order n, 1  k  n−1, i.e. the hypergraph with the set V n = {1, 2, , n} of vertices and the set  V n k  of edges. If there exist...

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

... other standard notation comes from [1]. the electronic journal of combinatorics 18 (2011), #P149 2 Long path lemma concerning connectivity and independence number Shinya Fujita ∗ Alexander Halperin † Colton ... theorem and, following the proofs presented in [4], we prove the following lemma which is o ur main result. Lemma 1 Let k ≥ 1 be an integer and let G be a g raph of...

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