Restricted partition functions as Bernoulli and Eulerian polynomials of higher order

Explicit expressions for restricted partition function W(s,d^m) and its quasiperiodic components W_j(s,d^m) (called Sylvester waves) for a set of positive integers d^m = {d₁, d₂, ..., d_m} are derived. The formulas are represented in a form of a finite sum over Bernoulli and Eulerian polynomials of higher order with periodic coefficients. A novel recursive relation for the Sylvester waves is established. Application to counting algebraically independent homogeneous polynomial invariants of finite groups is discussed. 2000 Mathematics Subject Classification Primary—11P81; Secondary—11B68, 11B37 The research was supported in part (LGF) by the Gileadi Fellowship program of the Ministry of Absorption of the State of Israel.     

Symmetric block bases of sequences with large average growth

We show that if 0<ε≦1, 1≦p<2 andx ₁, …,x _n is a sequence of unit vectors in a normed spaceX such thatE ‖∑ _l ⁿ ε_i x _l‖≧n ^1/p, then one can find a block basisy ₁, …,y _m ofx ₁, …,x _n which is (1+ε)-symmetric and has cardinality at leastγn ^2/p-1(logn)⁻¹, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first is a sequencex ₁, …,x _n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n ^2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn ^2/p-1(logn)^4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2]. We include an appendix giving a simple counterexample to a question about norm-attaining operators.     

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     

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.     

Strong approximation ofGSBV functions by piecewise smooth functions

Let Ω be an open and bounded subset ofR ⁿ with locally Lipschitz boundary. We prove that the functionsv∈SBV(Ω,R ^m ) whose jump setS _vis essentially closed and polyhedral and which are of classW ^{k, ∞} (S _v,R ^m) for every integerk are strongly dense inGSBV ^p(Ω,R ^m ), in the sense that every functionu inGSBV ^p(Ω,R ^m ) is approximated inL ^p(Ω,R ^m ) by a sequence of functions {v _k{_j∈N with the described regularity such that the approximate gradients ∇v _jconverge inL ^p(Ω,R ^nm ) to the approximate gradient ∇u and the (n−1)-dimensional measure of the jump setsS _{v j} converges to the (n−1)-dimensional measure ofS _u. The structure ofS _v can be further improved in casep≤2.

---

Sunto Sia Ω un aperto limitato diR ⁿ con frontiera localmente Lipschitziana. In questo lavoro si dimostra che le funzioniv∈SBV(Ω,R ^m ) con insieme di saltoS _v essenzialmente chiuso e poliedrale che sono di classeW ^{k, ∞} (S _v,R ^m ) per ogni interok sono fortemente dense inGSBV ^p(Ω,R ^m ), nel senso che ogni funzioneu∈GSBV ^p(Ω,R ^m ) è approssimata inL ^p(Ω,R ^m ) da una successione di funzioni {v _j}_j∈N con la regolaritá descritta tali che i gradienti approssimati ∇v _jconvergono inL ^p(Ω,R ^nm ) al gradiente approssimato ∇u e la misura (n−1)-dimensionale degli insiemi di saltoS _{v j}converge alla misura (n−1)-dimensionale diS _u. La struttura diS _vpuó essere migliorata nel caso in cuip≤2.

     

Some notes on densely continuous forms

We consider a special space of set-valued functions (multifunctions), the space of densely continuous forms D(X, Y) between Hausdorff spaces X and Y, defined in [HAMMER, S. T.—McCOY, R. A.: Spaces of densely continuous forms, Set-Valued Anal. 5 (1997), 247–266] and investigated also in [HOLá, L’.: Spaces of densely continuous forms, USCO and minimal USCO maps, Set-Valued Anal. 11 (2003), 133–151]. We show some of its properties, completing the results from the papers [HOLY, D.—VADOVIČ, P.: Densely continuous forms, pointwise topology and cardinal functions, Czechoslovak Math. J. 58(133) (2008), 79–92] and [HOLY, D.—VADOVIČ, P.: Hausdorff graph topology, proximal graph topology and the uniform topology for densely continuous forms and minimal USCO maps, Acta Math. Hungar. 116 (2007), 133–144], in particular concerning the structure of the space of real-valued locally bounded densely continuous forms D _p ^*(X) equipped with the topology of pointwise convergence in the product space of all nonempty-compact-valued multifunctions. The paper also contains a comparison of cardinal functions on D _p ^*(X) and on real-valued continuous functions C _p (X) and a generalization of a sufficient condition for the countable cellularity of D _p ^*(X). This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-006904 and by the Eco-Net (EGIDE) programme of the Laboratoire de Mathématiques de l’Université de Saint-Etienne (LaMUSE), France.     

Embedding Structures

 For any quasiordered set (`quoset') or topological space S, the set Sub S of all nonempty subquosets or subspaces is quasiordered by embeddability. Given any cardinal number n, denote by p _n and q _n the smallest size of spaces S such that each poset, respectively, quoset with n points is embeddable in Sub S. For finite n, we prove the inequalities n + 1 ≤p _n ≤q _n ≤p _n + l(n) + l(l(n)), where l(n) = min{k∈ℕ∣n≤2 ^k }. For the smallest size b _n of spaces S so that Sub S contains a principal filter isomorphic to the power set ?(n), we show n + l(n) − 1 ≤b _n ≤n + l(n) + l(l(n))+2. Since p _n ≤b _n , we thus improve recent results of McCluskey and McMaster who obtained p _n ≤n ². For infinite n, we obtain the equation b _n = p _n = q _n = n. Received: April 19, 1999 Final version received: February 21, 2000     

Axioms of determinacy and biorthogonal systems

If allΠ _n ¹ games are determined, every non-norm-separable subspaceX ofl ^∞(N) which is W* —Σ _n ^+1/1 contains a biorthogonal system of cardinality 2^ℵ ₀. In Levy’s model of Set Theory, the same is true of every non-norm-separable subspace ofl ^∞(N) which is definable from reals and ordinals. Under any of the above assumptions,X has a quotient space which does not linearly embed into 1^∞(N).     

On a Delay Reaction-Diffusion Difference Equation of Neutral Type

In this paper, we first consider a delay difference equation of neutral type of the form: Δ(y _n + py _n−k + q _n y _n−l = 0 for n∈ℤ⁺(0) (1*) and give a different condition from that of Yu and Wang (Funkcial Ekvac, 1994, 37(2): 241–248) to guarantee that every non-oscillatory solution of (1*) with p = 1 tends to zero as n→∞. Moreover, we consider a delay reaction-diffusion difference equation of neutral type of the form: Δ₁(u _n,m + pu _n−k,m ) + q _n,m u _n−l,m = a ²Δ² ₂ u _{n +1, m−1} for (n,m) ∈ℤ⁺ (0) ×Ω, (2*) study various cases of p in the neutral term and obtain that if p≥−1 then every non-oscillatory solution of (2*) tends uniformly in m∈Ω to zero as n→∞; if p = −1 then every solution of (2*) oscillates and if p < −1 then every non-oscillatory solution of (2*) goes uniformly in m∈Ω to infinity or minus infinity as n→∞ under some hypotheses. Received July 14, 1999, Revised August 10, 2000, Accepted September 30, 2000     

Riesz Transforms on Groups of Heisenberg Type

The aim of this article is to prove the following theorem. Theorem Let p be in (1,∞), ℍ _n,m a group of Heisenberg type, ℛ the vector of the Riesz transforms on ℍ _n,m . There exists a constant C _p independent of n and m such that for every f∈L ^p (ℍ _n,m )

On Li’s coefficients for the Rankin–Selberg <Emphasis Type="Italic">L</Emphasis>-functions

We define a generalized Li coefficient for the L-functions attached to the Rankin–Selberg convolution of two cuspidal unitary automorphic representations π and π ^′ of GL_m(\mathbbA_F)GL_{m}(\mathbb{A}_{F}) and GL_m^￠(\mathbbA_F)GL_{m^{\prime }}(\mathbb{A}_{F}) . Using the explicit formula, we obtain an arithmetic representation of the n th Li coefficient l_p,p^￠(n)\lambda _{\pi ,\pi ^{\prime }}(n) attached to L(s,p_f×[(p)\tilde]_f^￠)L(s,\pi _{f}\times \widetilde{\pi}_{f}^{\prime }) . Then, we deduce a full asymptotic expansion of the archimedean contribution to l_p,p^￠(n)\lambda _{\pi ,\pi ^{\prime }}(n) and investigate the contribution of the finite (non-archimedean) term. Under the generalized Riemann hypothesis (GRH) on non-trivial zeros of L(s,p_f×[(p)\tilde]_f^￠)L(s,\pi _{f}\times \widetilde{\pi}_{f}^{\prime }) , the nth Li coefficient l_p,p^￠(n)\lambda _{\pi ,\pi ^{\prime }}(n) is evaluated in a different way and it is shown that GRH implies the bound towards a generalized Ramanujan conjecture for the archimedean Langlands parameters μ _π (v,j) of π. Namely, we prove that under GRH for L(s,p_f×[(p)\tilde]_f)L(s,\pi _{f}\times \widetilde{\pi}_{f}) one has |Rem_p(v,j)| ￡ \frac14|\mathop {\mathrm {Re}}\mu_{\pi}(v,j)|\leq \frac{1}{4} for all archimedean places v at which π is unramified and all j=1,…,m.     

Embeddingl p k in subspaces ofL p forp>2

The aim of the present paper is to estimate in a precise manner the integerk=k(p,m,n,∈) so that an arbitrarym-dimensional subspaceX of the spacel _p ⁿ ;p>2, contains an (1+∈)-isomorph ofl _p ^k . The main argument of the proof consists of a probabilistic selection which uses a lemma of Slepian. The same method also shows that any system of normalized functions inL _p ;p≥2, which is equivalent to the unit vector basis ofl _p ⁿ , contains, for any∈>0, a subsystem of sizeh proportional ton, which is (1+∈)-equivalent to the unit vector basis ofl _p ^h . The authors were supported by Grant No. 87-0079 from BSF.     

Greedy Bases for Besov Spaces

We prove that the Banach space (?_n=1^￥l_pⁿ)_lq(\bigoplus_{n=1}^{\infty}\ell_{p}^{n})_{\ell_{q}}, which is isomorphic to certain Besov spaces, has a greedy basis whenever 1≤p≤∞ and 1<q<∞. Furthermore, the Banach spaces (?_n=1^￥l_pⁿ)_l1(\bigoplus_{n=1}^{\infty}\ell _{p}^{n})_{\ell_{1}}, with 1<p≤∞, and (?_n=1^￥l_pⁿ)_c0(\bigoplus_{n=1}^{\infty}\ell_{p}^{n})_{c_{0}}, with 1≤p<∞, do not have a greedy basis. We prove as well that the space (?_n=1^￥l_pⁿ)_lq(\bigoplus_{n=1}^{\infty}\ell _{p}^{n})_{\ell_{q}} has a 1-greedy basis if and only if 1≤p=q≤∞.     

Classification of the isomorphic types of martingale-H 1 spaces

LetF _n be an increasing sequence of finite fields on a probability space (Ω,F _n,P) whereF denotes the σ-algebra generated by ∪F _n. ThenF _n is isomorphic to one of the following spaces:H ¹(δ), ΣH _n ¹ ,l ^l.     

Intersection theorems with geometric consequences

In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ₀, μ₁, ..., μ_s are distinct residues modp (p is a prime) such thatk ≡ μ₀ (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μ_i (modp) for somei, 1 ≦i≦s, then |ℱ|≦( _s ⁿ ). As a consequence we show that ifR ⁿ is covered bym sets withm<(1+o(1)) (1.2) ⁿ then there is one set within which all the distances are realised. It is left open whether the same conclusion holds for compositep.     

The Banach-Mazur distance to the cube and the Dvoretzky-Rogers factorization

We show the existence of a sequence (λ _n ) of scalars withλ _n =o(n) such that, for any symmetric compact convex bodyB ⊂R ⁿ , there is an affine transformationT satisfyingQ ⊂T(B) ⊂λ _n Q, whereQ is then-dimensional cube. This complements results of the second-named author regarding the lower bound on suchλ _n . We also show that ifX is ann-dimensional Banach space andm=[n/2], then there are operatorsα:l ₂ ^m →X andβ:X→l _∞ ^m with ‖α‖·‖β‖≦C, whereC is a universal constant; this may be called “the proportional Dvoretzky-Rogers factorization”. These facts and their corollaries reveal new features of the structure of the Banach-Mazur compactum. Research performed while this author was visiting IHES. Supported in part by the NSF Grant DMS-8702058 and the Sloan Research Fellowship.     

Geometric Optimization Problems Likely Not Contained in $$\mathbb{A}\mathbb{P}\mathbb{X}$$

   Abstract. Maximizing geometric functionals such as the classical l _p -norms over polytopes plays an important role in many applications, hence it is desirable to know how efficiently the solutions can be computed or at least approximated. While the maximum of the l _∞ -norm over polytopes can be computed in polynomial time, for 2≤ p < ∞ the l _p -norm-maxima cannot be computed in polynomial time within a factor of 1.090 , unless P=NP. This result holds even if the polytopes are centrally symmetric parallelotopes. Quadratic Programming is a problem closely related to norm-maximization, in that in addition to a polytope P ⊂ R ⁿ , numbers c _ij , 1≤ i≤ j≤ n , are given and the goal is to maximize Σ _{1≤ i≤ j≤ n} c _ij x _i x _j over P . It is known that Quadratic Programming does not admit polynomial-time approximation within a constant factor, unless P=NP. Using the observation that the latter result remains true even if the existence of an integral optimal point is guaranteed, in this paper it is proved that analogous inapproximability results hold for computing the l _p -norm-maximum and various l _p -radii of centrally symmetric polytopes for 2≤ p < ∞.     

Geometric Optimization Problems Likely Not Contained in APX

Abstract. Maximizing geometric functionals such as the classical l _p -norms over polytopes plays an important role in many applications, hence it is desirable to know how efficiently the solutions can be computed or at least approximated. While the maximum of the l _∞ -norm over polytopes can be computed in polynomial time, for 2≤ p < ∞ the l _p -norm-maxima cannot be computed in polynomial time within a factor of 1.090 , unless P=NP. This result holds even if the polytopes are centrally symmetric parallelotopes. Quadratic Programming is a problem closely related to norm-maximization, in that in addition to a polytope P ⊂ R ⁿ , numbers c _ij , 1≤ i≤ j≤ n , are given and the goal is to maximize Σ _{1≤ i≤ j≤ n} c _ij x _i x _j over P . It is known that Quadratic Programming does not admit polynomial-time approximation within a constant factor, unless P=NP. Using the observation that the latter result remains true even if the existence of an integral optimal point is guaranteed, in this paper it is proved that analogous inapproximability results hold for computing the l _p -norm-maximum and various l _p -radii of centrally symmetric polytopes for 2≤ p < ∞.     

On the existence and nonexistence of global solutions for the porous medium equation with strongly nonlinear sources in a cone

In this paper, we study the initial-boundary value problem of the porous medium equation u _t  = Δu ^m  + V(x)u ^p in a cone D = (0, ∞) × Ω, where V(x) ~ (1 + |x|) ^σ . Let ω ₁ denote the smallest Dirichlet eigenvalue for the Laplace–Beltrami operator on Ω and let l denote the positive root of l ² + (n − 2)l = ω ₁. We prove that if m ≤ p ≤ m + (2 + σ)/(n + l), then the problem has no global nonnegative solutions for any nonnegative u ₀ unless u ₀ = 0; if p > m + (2 + σ)/n, then the problem has global solutions for some u ₀ ≥ 0.     

Residue races

Given a prime p and distinct non-zero integers a₁, a₂,..., a_k (mod p), we investigate the number N = N(a₁, a₂,..., a_k; p) of residues n (mod p) for which (na₁)_p < (na₂)_p < ... < (na_k)_p, where (b)_p is the least non-negative residue of b (mod p). We give complete solutions to the problem when k = 2,3,4, and establish some general results corresponding to k≥5. The first author is a Presidential Faculty Fellow. He is also supported, in part, by the National Science Foundation. 2000 Mathematics Subject Classification Primary—11A07; Secondary—11F20