Báo cáo toán học: "Noncommutative integration for states on von Neumann algebras " pot

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 ∈ ... the nonempty interior of a closed convex cone. In [11] Problem (P 1 )and(P 2 )are considered under the assumption that C(z, ξ,x)isthesumofF (z,ξ,x)anda closed convex cone. Our main result...

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

12 268 0
Báo cáo toán học: " New Bounds for Union-free Families of Sets" potx

Báo cáo toán học: " New Bounds for Union-free Families of Sets" potx

... random con- struction are much smaller than those which can be explicitly constructed. This suggests trying a combined construction. By basing the random con- struction on explicitly constructed ... will yield bounds on the size of union-free families. the electronic journal of combinatorics 5 (1998), # R39 11 4 Lower bound on f We give a construction of a (strongly) union-free family o...

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

16 296 0
Báo cáo toán học: "RSK Insertion for Set Partitions and Diagram Algebras" pps

Báo cáo toán học: "RSK Insertion for Set Partitions and Diagram Algebras" pps

... second from Γ k , P λ =  , , , , , ,  , =  ∅, ∅, , , , , ,  . For our bijection in Section 3 we will use Λ k n , and for our bijection in Section 4 we will use Γ k . The Bratteli diagram for ... the dimensions of the irreducible representations (for each of the diagram algebras mentioned in item 1 above). 3. Our algorithms for the bijections in (1.4) and (1.5) each use iteratio...

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

24 185 0
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

... 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 an involution ... 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 const...

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: "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
Từ khóa:
w