Báo cáo toán học: "Parity Theorems for Statistics on Domino Arrangements" pot

Báo cáo toán học: "Parity Theorems for Statistics on Domino Arrangements" pot

Báo cáo toán học: "Parity Theorems for Statistics on Domino Arrangements" pot

... 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
  • 13
  • 162
  • 0
Báo cáo toán học: "Covering Codes for Hats-on-a-line" pot

Báo cáo toán học: "Covering Codes for Hats-on-a-line" pot

... possible information on which to base his color. A front- to-back ordering is the least advantageous for X as each announcer has no information that he can use to determine his color and cannot convey ... demonstrating a strategy that matches the same. Some interesting situations arise when the prisoners don’t follow a back-to-front order in calling out their hat colors. In Section 4, we...
Ngày tải lên : 07/08/2014, 13:21
  • 12
  • 196
  • 0
Báo cáo toán học: "Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on CN" doc

Báo cáo toán học: "Uniqueness Theorems for Harmonic and Separately Harmonic Entire Functions on CN" doc

... 2004 Abstract. For harmonic and separately harmonic functions, we give results similar to the Carlson-Boas theorem. We give also harmonic analogous of the Polya and Guelfond theorems. 1. Introduction The ... vanishes on N. In [3] Boas extended Carlson’s theorem to harmonic functions and proved the following theorem: Theorem 1.1. (Boas theorem) Let h be an entire harmonic function on C...
Ngày tải lên : 06/08/2014, 05:20
  • 6
  • 279
  • 0
Báo cáo toán học: " Existence Theorems for Some Generalized Quasivariational Inclusion Problems" pot

Báo cáo toán học: " Existence Theorems for Some Generalized Quasivariational Inclusion Problems" pot

... notions of proper D-quasiconvexity and upper D-quasiconvexity reduce to the notion of proper D-quasiconvexity of [4]. We recall also the notion of lower D-quasiconvexity of f on a [11]: for all η i ∈ ... 4.2.  Existence Theorems for Some Generalized Quasivariational Inclusion Problems 121 be a closed convex cone and F : E × K × K −→ 2 Y be a upper D-continuous and lower (−D)-continuo...
Ngày tải lên : 06/08/2014, 05:20
  • 12
  • 268
  • 0
Báo cáo toán học: "Generating function for K-restricted jagged partitions" pot

Báo cáo toán học: "Generating function for K-restricted jagged partitions" pot

... the conditions: n j ≥ n j+K−1 +1 orn j = n j+1 − 1=n j+K−2 +1= n j+K−1 (called K-restrictions) for all values of j ≤ m − K +1,withK>2. The first condition enforces a difference-one condition between ... physical realization of the K-restricted jagged partitions for K odd has been found recently, in the context of superconformal minimal models [14]. 2 Jagged partitions Let us start by for...
Ngày tải lên : 07/08/2014, 08:22
  • 17
  • 131
  • 0
Báo cáo toán học: "tability analysis for k-wise intersecting families" potx

Báo cáo toán học: "tability analysis for k-wise intersecting families" potx

... contained in juntas, sub- mitted for publication. [4] P. Erd˝os, C. Ko, R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math Oxford Ser. (2) 12(1961), 313- 320. the electronic ... all sets in F σ contain a common index, say v, so call σ v-saturated to identify this common index. For i ≤ n, define an adjacent transposition A i on a cyclic order σ as an operation th...
Ngày tải lên : 08/08/2014, 14:23
  • 8
  • 180
  • 0
Báo cáo toán học: "A recurrence for bounds on dominating sets in k-majority tournaments" pps

Báo cáo toán học: "A recurrence for bounds on dominating sets in k-majority tournaments" pps

... bipartite domination problem may be generalized in ABMT’s. We will show by induction that the following proposition holds : Proposition 1. There exists a function, F ∗ : N × N → N, such that for every ... that the inequality in Equation 1 is due to the minimality of F (k). We will need the following definition for the inductive construction of the recurrence. Definition 2. Let T = (V, E) be...
Ngày tải lên : 08/08/2014, 14:23
  • 9
  • 217
  • 0

Xem thêm