Báo cáo toán học: "Cyclic sieving for longest reduced words in the hyperoctahedral group" doc

... P(w) be the RSK insertion tableau and let P ′ = P ′ (w) be the mixed insertion tableau. Then the set of words that mixed insert into P ′ is contained in the set of words that RSK insert into P ... Removing paired brackets, one obtains ))(, corresponding to the subword · · · · 22 · 3 · ·. the electronic journal of combinatorics 17 (2010), #R67 7 Cyclic sieving for longes...

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

... from i to j in the original graph, we put an edge with the same endpo ints in the new graph. Finally, if there is an edge from some i 2 to some j 3 , we put an edge from i 2 to j 1 in the new graph. ... one of the edges must be a diameter. There are n ′ choices for the diameter. Once a diameter has been fixed, the remaining k − 1 edges are determined by the k ′ − 1 edge...

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

... affects the optimal values of p and q as e xplained in Section 4. Figure 5b depicts the RAP-MAC gain for different b values. As b increases, the gain in the CRN goodput increases up to 138% as the ... respectively. However, the RAP-MAC goodput gain decreases before increasing again for the more stringent outage constraint of b equals to 1%. As we mentioned earlier, the...

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

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

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

... two in Γ. We partition C  into two sets, X and Y : X contains the vertices having degree two or three in Γ and Y contains the vertices having degree at least four in Γ. Let a, b, c and d be the ... have degree zero or one in Γ, thus improving the inequality linking |C  | and  ≥3 . We give a sketch only for Cases A and B3b. The other cases are very similar. The followi...

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

... vertices are in the same column, they form a missing edge of type 1. If two vertices are in the left column and one is in the right, the higher of the two in the left is red, so they form a missing edge ... contain the entire expanded color set. Otherwise, all but the lowest of the k vertices are blue. If there is a red vertex in the column to the left, then it...

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

... increase the inter-us er interference, in which the multiplexing gain makes transmit power saving, but inter-user interference induces transmit power wasting. In order to maximize BPJ-EE, the trade- off ... problem in t he down- link MIMO systems in this article. Previous works mainly focused on maxi mizing energy efficiency in the single-input single-output (SISO) sys- tems...

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

... embedding/detection domain. In the first class, the embedding is performed directly in the spatial domain [3, 4, 5]. The second class is referred to as transform domain techniques. In these methods, the water- mark ... and the imaginary part of S(k), respectively. As mentioned in the introduction, the watermark embedding is performed in the Fourier domain and more s...

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

... P 0 (C,π) in one of the pie slices, with the vertex [n]=11···1atp and the vertex ∅ =00···0 at the point at in nity. (If we view the embedding on the sphere, p is at the north pole and the point at in nity ... all chains in T  ,sonodesinchains in C’s subtree are embedded to the right of those in chains in T  .Lets = starter(C)and t = terminator(C). No node with...

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