Correlated equilibria of games with many players

Let G _m,n be the class of strategic games with n players, where each player has m≥2 pure strategies. We are interested in the structure of the set of correlated equilibria of games in G _m,n when n→∞. As the number of equilibrium constraints grows slower than the number of pure strategy profiles, it might be conjectured that the set of correlated equilibria becomes large. In this paper, we show that (1) the average relative measure of the set of correlated equilibria is smaller than 2⁻ⁿ; and (2) for each 1<c<m, the solution set contains c ⁿ correlated equilibria having disjoint supports with a probability going to 1 as n grows large. The proof of the second result hinges on the following inequality: Let c ₁, …, c _l be independent and symmetric random vectors in R ^k, l≥k. Then the probability that the convex hull of c ₁, …, c _l intersects R ^k ₊ is greater than or equal to . Received: December 1998/Final version: March 2000     

On the structure of linear graphs

Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n ²/4]+1) contains a circuit ofl edges for every 3 ≦l<c ₂ n, also that everyG(n; [n ²/4]+1) contains ak _e(u _n, u_n) withu _n=[c ₁ logn] (for the definition ofk _e(u _n, u_n) see the introduction). Finally fort>t ₀ everyG(n; [tn ^3/2]) contains a circuit of 2l edges for 2≦l<c ₃ t ². This work was done while the author received support from the National Science Foundation, N.S.F. G.88.     

Minkowski spaces with extremal distance from the Euclidean space

It is proved that if the Banach-Mazur distance between ann-dimensional Minkowski spaceB andl ₂ ⁿ satisfiesd (B ₁ l ₂ ⁿ ) ≧c √n (for some constantc>0 and for bign) thenB contains anA(c)-isomorphic copy ofl ₁ ^k (fork ∼ log log logn). In the special cased (B ₁ l ₂ ⁿ ) = √n,B contains an isometric copy ofl ₁ ^k fork ∼ logn.     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

Higher Chern Classes and Steenrod Operations in Motivic Cohomology

In this short paper we investigate the relation between higher Chern classes and reduced power operations in motivic cohomology. More precisely, we translate the well-known arguments [5] into the context of motivic cohomology and define higher Chern classes c_p,q : K _p(X) → H^2q-p (X,Z(q)) → H^2q-p(X, Z/l(q)), where X is a smooth scheme over the base field k, l is a prime number and char(k) ≠ l. The same approach produces the classes for K-theory with coefficients as well. Let further Pⁱ : H^m(X, Z/l(n)) → H^m+2i(l-1) (X, Z/l(n + i(l - 1))) denote the ith reduced power operation in motivic cohomology, constructed in [2]. The main result of the paper looks as follows.     

Efficient algorithms for a constrained k-tree core problem in a tree network

Let T=(V,E) be a free tree in which each vertex has a weight and each edge has a length. Let n=|V|. Given T and parameters k and l, a (k,l)-tree core is a subtree X of T with diameter l, having k leaves, which minimizes the sum of the weighted distances from all vertices in T to X. In this paper, two efficient algorithms are presented for finding a (k,l)-tree core of T. The first algorithm has O(n²) time complexity for the case that each edge has an arbitrary length. The second algorithm has O(lkn) time complexity for the case that the lengths of all edges are 1. The (k,l)-tree core problem has an application in distributed database systems.     

Color critical hypergraphs with many edges

We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(k, r, l) such that for large enough n there exists a k‐color‐critical r‐uniform hypergraph on less than n vertices, having more than cn^l edges, and having no l‐set of vertices occuring in more than one edge. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 56–74, 2006     

The asymptotic number of labeled connected graphs with a given number of vertices and edges

Let c(n, q) be the number of connected labeled graphs with n vertices and q ≤ N = (2n ) edges. Let x = q/n and k = q ? n. We determine functions w_k ? 1. a(x) and φ(x) such that c(n, q) ? w_k(q^N)eⁿφ(x)+a(x) uniformly for all n and q ≥ n. If ? > 0 is fixed, n→ ∞ and 4q > (1 + ?)n log n, this formula simplifies to c(n, q) ? (N^q) exp(–ne^?2q/n). on the other hand, if k = o(n^1/2), this formula simplifies to c(n, n + k) ? 1/2 w_k (3/π)^1/2 (e/12k)^k/2nⁿ?^(3k?1)/2.     

Numerical properties of Chern classes of certain covering manifolds

In this paper, we study numerical properties of Chern classes of certain covering manifolds. One of the main results is the following: Let ψ : X → Pⁿ be a finite covering of the n-dimensional complex projective space branched along a hypersurface with only simple normal crossings and suppose X is nonsingular. Let c_i(X) be the i-th Chern class of X. Then (i) if the canonical divisor K_X is numerically effective, then (−1)^kc_k(X) (k ≥ 2) is numerically positive, and (ii) if X is of general type, then (−1)ⁿcⁱ_l (X) cⁱ_r, (X) > 0, where i_l + … + i_r = n. Furthermore we show that the same properties hold for certain Kummer coverings.     

Asymptotic Upper Bounds for Ramsey Functions

 We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nf _{a +1}(d), where f _{a +1}(d)=∫₀ ¹(((1−t)^{1/( a +1)})/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(K _k + _l ,K _n )≤ (l+o(1))n ^k /(logn) ^{k −1}. In particular, r(K _k , K _n )≤(1+o(1))n ^{k −1}/(log n) ^{k −2}. Received: May 11, 1998 Final version received: March 24, 1999     

On Sums of Two Coprime k-th Powers(II)

For fixed k ≥ 3, let E_k(x) denote the error term of the sum ?_{n ￡ x}r_k(n)\sum_{n\le x}\rho_k(n) , where r_k(n) = ?_{n=|m|^k+|l|^k, g.c.d.(m,l)=1}\rho_k(n) = \sum_{n=|m|^k+|l|^k, g.c.d.(m,l)=1} 1. It is proved that if the Riemann hypothesis is true, then E₃(x) << x^331/1254+eE_3(x)\ll x^{331/1254+\varepsilon} , E₄(x) << x^37/184+eE_4(x)\ll x^{37/184+\varepsilon} . A short interval result is also obtained.     

Chen’s Conjecture and Its Generalization

Let l1, l2, ..., lg be even integers and x be a sufficiently large number. In this paper, the authors prove that the number of positive odd integers k ≤ x such that （k ＋l1）^2, （k ＋l2）^2, ..., （k ＋lg）^2 can not be expressed as 2^n＋p^α is at least c（g）x, where p is an odd prime and the constant c（g） depends only on g.     

A bound for Wilson's theorem (II)

In this article we prove the following theorem. For any k ≥ 3, let c(k, 1) = exp{exp{k^k2}}. If v(v − 1) ≡ 0 (mod k(k −1)) and v − 1 ≡ 0 (mod k−1) and v > c(k, 1), then a B(v,k, 1) exists. © 1996 John Wiley & Sons, Inc.     

Some remarks about embeddings ofl 1 k in finite-dimensional spaces

The spanX _n of functionsx _i(t)=±1,i=1, …,n, on a setT in the supremum norm is considered. It is proved, for example, thatX _n contains an isometric copy ofl ₁ ^k fork≧cM _n ² /n logn whereM _n is the Rademacher average of {x _i} ₁ ⁿ . This generalizes a result of Pisier for characters. The proof uses a new combinatorial tool.     

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

A self-normalized Erd s—Rényi type strong law of large numbers

The original Erd s—Rényi theorem states that max_0kn∑^k+[clogn]_i=k+1X_i/[clogn]→α(c),c>0, almost surely for i.i.d. random variables {X_n, n1} with mean zero and finite moment generating function in a neighbourhood of zero. The latter condition is also necessary for the Erd s—Rényi theorem, and the function α(c) uniquely determines the distribution function of X₁. We prove that if the normalizing constant [c log n] is replaced by the random variable ∑^k+[clogn]_i=k+1(X²_i+1), then a corresponding result remains true under assuming only the exist first moment, or that the underlying distribution is symmetric.     

ADDITIVE FAMILIES OF INVARIANTS OF SKEWSYMMETRIC TENSORS

Abstract

Let d be a positive integer and F be a field of characteristic 0. Suppose that for each positive integer n, I _n is a polynomial invariant of the usual action of GL_n (F) on Λ^d(Fⁿ), such that for t ? Λ^d(F ^k) and s ? Λ^d(F ^l), I _{k + l} (t l s) = I _k(t)I _t (s), where t ⊥ s is defined in §1.4. Then we say that {I_n} is an additive family of invariants of the skewsymmetric tensors of degree d, or, briefly, an additive family of invariants. If not all the I_n are constant we say that the family is non-trivial. We show that in each even degree d there is a non-trivial additive family of invariants, but that this is not so for any odd d. These results are analogous to those in our paper [3] for symmetric tensors. Our proofs rely on the symbolic method for representing invariants of skewsymmetric tensors. To keep this paper self-contained we expound some of that theory, but for the proofs we refer to the book [2] of Grosshans, Rota and Stein.     

Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.     

Representation of measurable functions by series in Walsh subsystems

For any sequence {ω(n)} _n∈ℕ tending to infinity we construct a “quasiquadratic” representation spectrum Λ = {n ² + o(ω(n))} _n∈ℕ: for any almost everywhere (a. e.) finite measurable function f(x) there exists a series in the form $ \mathop \sum \limits_{k \in \Lambda } $ \mathop \sum \limits_{k \in \Lambda } α _k ω _k (x) that converges a. e. to this function, where {w _k (x)} _k∈ℕ is the Walsh system. We find representation spectra in the form {n ^l + o(n ^l )} _n∈ℕ, where l ∈ {2 ^k } _k∈ℕ.