Báo cáo toán học: "Potential-Based Strategies for Tic-Tac-Toe on the Integer Lattice with Numerous Directions" potx

... considered in this study. In Section 3, we introduce the approaches to analyze video 3 Resource reservation for mobile hotspots in vehicular envi- ronments with cellular/WLAN interworking Wei Song Faculty ... made available soon. Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking EURASIP Journal on Wire...

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

... (support code 9 Resource Allocation for Asymmetric Multi-Way Relay Com- munication over Orthogonal Channels Christoph Hausl 1 , Onurcan Iáscan 1 and Francesco Rossetto 2 1 Institute for Communications ... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Resource Allocation for Asymmetric Multi-Way Relay...

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

... Journal of Inequalities and Applications References 1 R. P. Agarwal, Difference Equations and Inequalities: Theory, Methods and Applications, vol. 155 of Monographs and Textbooks in Pure and Applied ... differential equations and their discrete analogues,” Pan-American Mathematical Journal, vol. 9, no. 4, pp. 55–67, 1999. 7 B. G. Pachpatte, On the discrete generalizations of Gronwall’...

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

... class="bi x1 y0 w4 h 1" alt =""

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

... alt =""

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

... be reformulated in terms of the aforementioned statistics on binary words or lattice paths, our approach, based on statistics on domino arrangements, yields the most transparent constructions ... The foregoing observations establish (2.9) for 0  n  2since R ∗ n = R n for such n. Thus, it remains only to construct a ν-parity changing involution of R n −R ∗ n for n  3. Such...

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

... to two optimization problems related to covering codes in which one leads to an exact solution (for binary codes) . For instance, we show that for 0 <k<n,(n − k − d) ≤ α m n where d = t(n ... straightforward. x 1 calls out the value Y 2 =(  n i=2 y i )modm.Foreachi>1, x i ◦ can see the values y i+1 , ,y n ◦ has heard the values Y 2 and y 2 , ,y i−1 and therefore uses the exp...

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

... pairing- strategy for MB d S (m). Our conjecture is based on a pairing- strategy given by Hales and Jewett [1], [2] for the tic-tac-toe game played on Z ì Z with the four standard directions. They ... 87(7):575–576, 1980. the electronic journal of combinatorics 15 (2008), #N42 6 A Pairing Strategy for Tic-Tac-Toe on the Integer Lattice with Numerous...

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

... u and v. the electronic journal of combinatorics 14 (2007), #R65 7 A new upper bound on the total domination number of a graph 1 Michael A. Henning ∗ and 2 Anders Yeo 1 School of Mathematical ... 223–240. [12] S. Thomass´e and A. Yeo, Total domination of graphs and small transversals of hy- pergraphs. To appear in Combinatorica. [13] Z. Tuza, Covering al...

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

... clear that there is no rainbow k-matching. However, if there are more colors than in these colorings, is there a rainbow k-matching ? Schiermeyer [6] solved this problem affirmatively for k ≥ 2 and ... 3 2  + 2 or +3)-Colorings without rainbow k-matchings. In the coloring (a) of Figure 2, a complete subgraph K 2k− 3 of G is rainbow and the other edges are color ed with e...

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

... more vertices). Proposition 1. The density of every vertex identifying code for the infinite hexagonal grid is at least 2/5. Proof: Our proof is by the discharging method. Thus, D must contain at least 2/5 of the ... elsewhere. Theorem 1. The density of every vertex identifying code for the infinite hexagonal grid is at least 12/29. Proof: Our proof is by disch...

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

... all except for at most ℓ(ℓ + 3) points of B and therefore won the BigGame, which is a contradiction to the fact that Breaker wins the BigGame. Therefore by contradiction, it must be the case that ... sub-board to the next is due to a progression in at least one of the dimensions. There are only d dimensions, so there can be at most d switches. If there were d+1 switches, then t...

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

... analogous conditions for other elements of the group and to certain subgroups. In Section 2 we recall some notation along with the basic construction of the Leech lattice and the group ·0. In Section ... Section 5 we see how these results restrict to some subgroups of ·0. 2 The Leech Lattice and ·0 In this section we shall define the Leech lattice and the Conway group ·...

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

... horizon of both stands and in the organomineral horizon of the oak stand. Soils originating from the two stands showed distinct responses in net NO 3- production to the dolomite ... Original article Impact of dolomite lime on the ground vegetation and on potential net N transformations in Norway spruce (Picea abie...

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

... of D in V constitute a dominating set of T . The following variant of majority tournaments will prove useful for generating bounds for the size of dominating sets. Definition 1. A (t, m)-asymmetric ... partition of the vertex set V = A∪B, it may be that of the dominating set two vertices are in A and one in B. The following corollary shows that the dominating set may alwa...

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