Twisted Equivariant KK-Theory and the Baum–Connes Conjecture for Group Extensions

In this paper we study the stability of the Baum–Connes conjecture with coefficients undertaking group extensions. For this, it is necessary to extend Kasparov's equivariant KK-theory to an equivariant theory for twisted actions of groups on C ^*-algebras. As a consequence of our stability results, we are able to reduce the problem of whether closed subgroups of connected groups satisfy the Baum–Connes conjecture, with coefficients to the special case of center-free semi-simple Lie groups.     

Eisenstein series of 3/2 weight and one conjecture of Kaplansky

We shall prove thatf ₁ =x ² +y ⁴ + 7z ² represents all eligible numbers congruent to 2 mod 3 except 14 × 7^2k which was conjectured by Kanplansky. Our method is to use modular forms of weight 3/2. Our method can also be applied to other ternary quadratic forms.     

Lefschetz–Verdier Trace Formula and a Generalization of a Theorem of Fujiwara

The goal of this paper is to generalize a theorem of Fujiwara (Deligne’s conjecture) to the situation appearing in a joint work [KV] with David Kazhdan on the global Langlands correspondence over function fields. Moreover, our proof is more elementary than the original one and stays in the realm of ordinary algebraic geometry, that is, does not use rigid geometry. We also give a proof of the Lefschetz–Verdier trace formula and of the additivity of filtered trace maps, thus making the paper essentially self-contained. The work was supported by the Israel Science Foundation (Grant No. 555/04) Received: May 2005 Accepted: August 2005     

On finding a large number of 3D points with a small diameter

Given a set S of n points in R³, we wish to decide whether S has a subset of size at least k with Euclidean diameter at most r. It is unknown whether this decision problem is NP-hard. The two closely related optimization problems, (i) finding a largest subset of diameter at most r, and (ii) finding a subset of the smallest diameter of size at least k, were recently considered by Afshani and Chan. For maximizing the size, they presented several polynomial-time algorithms with constant approximation factors, the best of which has a factor of . For maximizing the diameter, they presented a polynomial-time approximation scheme. In this paper, we present improved approximation algorithms for both optimization problems. For maximizing the size, we present two algorithms: the first one improves the approximation factor to 2.5 and the running time by an O(n) factor; the second one improves the approximation factor to 2 and the running time by an O(n²) factor. For minimizing the diameter, we improve the running time of the PTAS from O(nlogn+2^O(1/ε3)n) to O(nlogn+2^{O(1/(ε1.5logε))}n).     

Harmoniques Sphériques et Représentations Irréductibles de O ( ∞ )

We build an irreducible unitary representation of SO( ) from the usual one of SO( n ) in the space of harmonic homogeneous polynomials of degree m of ⁿ . We give a characterization of these new representations which extends in a natural way the finite dimensional characterization. In the particular case of SO( ), we thus get some results of Olshanskii (cf. [12]). This leads to a new proof of McKean conjecture about irreducible representations of ( infin ) (cf. [10]).     

An Estimate for the Problem of Illumination of the Boundary of a Convex Body in E3

Let A be a convex body in Euclidean space E3. We denote by H(A) the smallest number of homothetic 'reduced copies of A by which it is possible to cover the whole of A. The conjecture of Hadwiger is H(A) 8. We prove that H(A) 16.     

Polynomials with graphs of maximum length

In this paper we find the pairs of functionsg, G (g<G) such that the maximum length of the graph of polynomials of given degree contained betweeng andG is attained on one of the two snakes generated by the functionsg andG. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 61–69, January, 1999.     

Spectrum is periodic for n-intervals

In this paper we study spectral sets which are unions of finitely many intervals in R. We show that any spectrum associated with such a spectral set Ω is periodic, with the period an integral multiple of the measure of Ω. As a consequence we get a structure theorem for such spectral sets and observe that the generic case is that of the equal interval case.     

A sufficient condition for the bicolorability of a hypergraph

In this note we prove a long-standing conjecture of Sterboul [P. Duchet, Hypergraphs, in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, 1995, pp. 381-432 (Chapter 7)], which states that a hypergraph is bicolorable provided it does not contain a specific kind of odd cycle. This is currently the strongest result of its kind, improving on results by Berge [Graphs and Hypergraphs, North-Holland, American Elsevier, Amsterdam, 1973] and Fournier and Las Vergnas [Une classe d’hypergraphes bichromatiques II, Discrete Math. 7 (1974) 99-106; A class of bichromatic hypergraphs, Ann. Discrete Math. 21, in: C. Berge, V. Chvátal (Eds.), Topics on Perfect Graphs, 1984, pp. 21-27].     

On a cycle partition problem

Let G be any graph and let c(G) denote the circumference of G. We conjecture that for every pair c₁,c₂ of positive integers satisfying c₁+c₂=c(G), the vertex set of G admits a partition into two sets V₁ and V₂, such that V_i induces a graph of circumference at most c_i, i=1,2. We establish various results in support of the conjecture; e.g. it is observed that planar graphs, claw-free graphs, certain important classes of perfect graphs, and graphs without too many intersecting long cycles, satisfy the conjecture.This work is inspired by a well-known, long-standing, analogous conjecture involving paths.