Báo cáo toán học: "Min-Wise independent linear permutations" doc

Báo cáo toán học: "Pattern avoidance in permutations: linear and cyclic orders" pdf

Báo cáo toán học: "Pattern avoidance in permutations: linear and cyclic orders" pdf

... functions, in the following scenarios: 1. linear orders on the domain and the codomain—this gives classical permutation avoidance; 2. a cyclic order on the domain and a linear order on the codomain—in ... Deutsch and Krattenthaler independently, we single out two geometrically significant classes of Dyck paths that correspond to two instances of simultaneous avoidance in the purely linear...

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

43 314 0
Báo cáo toán học: "Linearly Independent Products of Rectangularly Complementary Schur Functions" doc

Báo cáo toán học: "Linearly Independent Products of Rectangularly Complementary Schur Functions" doc

... = λ c ,are linearly independent of all other products s µ s µ c for µ ⊆ R. If the dimensions of R are both odd, the products s λ s λ c for λ almost self-complementary are linearly independent. By ... self-complementary products, s 2 λ where λ = λ c , are linearly inde- pendent of all other s λ s λ c . Conjecture: The products s λ s λ c are all linearly independent. 1 Introduction The Sc...

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

8 225 0
Báo cáo toán học: "321-polygon-avoiding permutations and Chebyshev polynomials" pps

Báo cáo toán học: "321-polygon-avoiding permutations and Chebyshev polynomials" pps

... 1, define L k n (s)= s  j=0 (−1) j  s−j j  f k (n−j). When n ≥ 2k, this sequence satisfies the linear recursive relation with constant coefficients: L k n (2k − 2) = L k n−1 (2k − 2) + L k n−3 (2k ... 1, define L k n (s)= s  j=0 (−1) j  s−j j  f k (n −j). When n ≥ 2k, this sequence satisfies the linear recursive relation with constant coefficients: L k n (2k − 2) = L k n−1 (2k − 2) + L k n−...

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

16 231 0
Báo cáo toán học: "SIGNED WORDS AND PERMUTATIONS, II; THE EULER-MAHONIAN POLYNOMIALS" doc

Báo cáo toán học: "SIGNED WORDS AND PERMUTATIONS, II; THE EULER-MAHONIAN POLYNOMIALS" doc

... statistic on c. For the construction we proceed as follows. Write the signed permutation w as the linear word w = x 1 x 2 x n ,wherex k is the image of the integer k (1 ≤ k ≤ n). For each k =1, ... 27 , , p. 210–224. [BjW88] Anders Bj¨orner and Michelle L. Wachs, Permutation Statistics and Linear Extensions of Posets, J. Combin. Theory, Ser. A,vol.58, , p. 85–114. [Bo68] N. Bourb...

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

18 347 0
Báo cáo toán học: "Convexly independent subsets of the Minkowski sum of planar point sets" pdf

Báo cáo toán học: "Convexly independent subsets of the Minkowski sum of planar point sets" pdf

... segments are convexly independent, that is, they form the vertex set of a convex polygon? In the special case when the elements of X themselves are convexly independent, they found a linear upper bound, ... element of a convexly independent subset of P ⊕ Q may be associated with several incidences between a curve C −q and a point of P . This suggests that the maximum size of a convexly...

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

4 206 0
Báo cáo toán học: "Maximum Independent Sets in Certain Powers of Odd Cycles" doc

Báo cáo toán học: "Maximum Independent Sets in Certain Powers of Odd Cycles" doc

... and x is d − |I|. Let S be an independent set in C d 2n+1 . A maximal clique K in C d 2n+1 is a hole of S if K ∩S = ∅. We let H(S) denote the set of holes of the independent set S. Note that there is ... vertex in S ∩ K v by parity.) Also note that the holes in a slice of an independent set S correspond to holes in H(S). We say that independent sets S, T in C d 2n+1 are isomorphic, an...

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

8 299 0
w