Báo cáo toán học: "RESTRICTED PERMUTATIONS, CONTINUED FRACTIONS, AND CHEBYSHEV POLYNOMIALS" pot

... follows.  RESTRICTED PERMUTATIONS, CONTINUED FRACTIONS, AND CHEBYSHEV POLYNOMIALS Toufik Mansour ∗ and Alek Vainshtein † ∗ Department of Mathematics † Department of Mathematics and Department of ... 1973. 6. V. Lakshmibai and B. Sandhya, Criterion for smoothness of Schubert varieties in Sl(n)/B, Proc. Indian Acad. Sci. 100 (1990), no. 1, 45–52. 7. L. Lorentzen and H. Waadel...

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

... Vainshtein. Restricted permutations, continued fractions, and Chebyshev polynomials. Electron. J. Combin., 7(1):#R17, 2000. [13] T. Mansour and A. Vainshtein. Layered restrictions and Chebyshev polynomials. Ann. ... techniques of Bandlow and Killpatrick [2] and Bandlow, Egge, and Killpatrick [1] to compute this bijection directly. To define our bijection, we first need to...

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

... solicited on both experimental and theoretical aspects, including new positioning algorithms and methodologies, system design and configurat ion, performance analysis and measurement campaigns. We ... sets (POCS) and outer approximation (OA) techniques for us e in positioning, and then de velop di s- tributed positioning algorithms based on POCS and OA. Improvement of coverage...

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

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

... have d η d λ   x∈A 4,λ h λ(,m) (x)  x∈A 4,η h η (x) =  x∈R(µ 1 ,µ  1 ) h(x)  x∈SQ(µ) h(x) and the proof is complete. References [Ok.Ol] Okounkov A. and Olshanski G., Shifted Schur functions, preprint. [Mac] Macdonald I.G., Symmetric functions and Hall polynomials, ... that s µ (x 1 ,x 2 ,···) is the corresponding Schur function, and s µ (1, ···,1)    µ  1 is the number of...

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

... for pointing out to me identity (4.7 ) in [1] and the paper [4], S.O. Warnaar for some helpful remarks and drawing my attention to [9], and R. Chapman and C. Krattenthaler for providing another ... b from the left b 1 and the i-th b from the right b 2 .Ifb 1 = b 2 we call u good of type b and define ψ(u)by changing b 1 to a and b 2 to ab.Thenψ(u) has the same length and the sa...

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

... orderings ‘≤  ’ and ‘≤  ’ on N 2 are defined by (i, j) ≤  (k, l) if and only if i ≤ k and j ≤ l, respectively by (i, j) ≤  (k, l) if and only if i ≤ k and j ≥ l. b. For skew shapes λ/κ and ν/µ, a ... R → and R ↓ of R ← and of R ↑ , respectively. We successively apply these inverse operations to the equation R ← (P ) = R ↑ (Q), and by commutation of R → and R ↓ (which fo...

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

... positions i and j correspond to the intersection of two planes, and so on. Hence, two code words w 1 and w 2 correspond- ing to the affine points P and Q will have t common entries if and only if ... Bruen. Coprimitive sets and inextendable codes. Des. Codes Cryptogr., 47(1-3):113–124, 2008. [3] T.L. Alderson, A. A. Bruen, and R. Silverman. Maximum distance separable codes and a...

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

... G, H 1 and H 2 respectively, and let m, m 1 and m 2 be the number of edges in G, H 1 and H 2 respectively. A certificate can be obtained as fo llows. Firstly, express both P (H 1 , λ) and P (H 2 , ... G 1 and G 2 by identifying vertices a 1 and b 1 in G 1 with vertices a 2 and b 2 in G 2 respectively. Then the graph obtained by identifying vertices a 1 and b 1 in G 1 with ver...

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

... A solution was given in 1994 by Dias da Silva and Hamidoune. In 1995, Alon, Nathanson and Ruzsa developed a polynomial method that allows one to handle restrictions of the type f(a, b) =0,wheref ... and investigate groups, distinct from Z/pZ. In particular, for A, B ⊆ Z/pZ and R⊆A × B of given cardinalities we give a sharp estimate for the number of distinct sums a + b with (a, b) /∈...

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