Lower bound for Ln/2 curvature norm and its application

We control the number of critical points of a height function arising from the Nash isometric embedding of a compact Riemanniann-manifoldM. The L^n/2 curvature norm ∥R∥ and a similar scalar ∥R∥ are introduced and their integralR(M) andR(M) overM. We prove thatR(M) is bounded below by a constant depending only onn and the Betti numbers ofM. Thus a new sphere theorem is proved by eliminating allith Betti numbers fori = 1, .…n −1. The emphasis is that our sphere theorem imposes no restriction on the range of curvature. Research partially supported by Grant-in-Aid for General Scientific Research, grant no. 07454018.     

On the Absolute Convergence of Fourier Series

The necessary and sufficient conditions of the absolute convergence of a trigonometric Fourier series are established for continuous 2-periodic functions which in [0, 2] have a finite number of intervals of convexity, and whose nth Fourier coefficients are O((l/n; f)/n), where ( f) is the continuity modulus of the function f.     

An Extremal Characterization of the Incidence Graphs of Projective Planes

Let G be a 4-cycle free, bipartite graph on 2n vertices with partitions of equal cardinality n. Let c₆(G) denote the number of cycles of length 6 in G. We prove that for n 3, c₆(G) , where , with equality if and only if G is the incidence point-line graph of a projective plane.     

Bordism of two commuting involutions

In this paper we obtain conditions for a Whitney sum of three vector bundles over a closed manifold, , to be the fixed data of a -action; these conditions yield the fact that if is the fixed data of a -action, where is the trivial one dimensional bundle, then the same is true for . The results obtained, together with techniques previously developed, are used to obtain, up to bordism, all possible -actions fixing the disjoint union of an even projective space and a point.

     

Average Number of Real Roots of Random Harmonic Equations

Let {g_k}be a sequence of normally distributed independent random variables with mathematical expectation zero and variance unity. Let _k (t ) (k = 0, 1, 2,...) be the normalized Jacobi polynomials orthogonal with respect to the interval [ – 1, 1 ]. Then it is proved that the average number of real roots of the random equations, _k=0 ⁿ g_kk(1)=C where Cis a constant, is asymptotically equal to n/in the same interval when nis large and even for C as long as C=O (n ²).     

Remarks on the Schoof-Elkies-Atkin algorithm

Schoof's algorithm computes the number of points on an elliptic curve defined over a finite field . Schoof determines modulo small primes using the characteristic equation of the Frobenius of and polynomials of degree . With the works of Elkies and Atkin, we have just to compute, when is a ``good" prime, an eigenvalue of the Frobenius using polynomials of degree . In this article, we compute the complexity of Müller's algorithm, which is the best known method for determining one eigenvalue and we improve the final step in some cases. Finally, when is ``bad", we describe how to have polynomials of small degree and how to perform computations, in Schoof's algorithm, on -values only.

     

Approximating the independence number via theϑ-function

We describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an independence numbern/k + m for some fixed integerk 3 and somem > 0, the algorithm finds, in random polynomial time, an independent set of size , improving the best known previous algorithm of Boppana and Halldorsson that finds an independent set of size (m ^1/(k–1)) in such a graph. The algorithm is based on semi-definite programming, some properties of the Lovász-function of a graph and the recent algorithm of Karger, Motwani and Sudan for approximating the chromatic number of a graph. If the-function of ann vertex graph is at leastMn ^1–2/k for some absolute constantM, we describe another, related, efficient algorithm that finds an independent set of sizek. Several examples show the limitations of the approach and the analysis together with some related arguments supply new results on the problem of estimating the largest possible ratio between the-function and the independence number of a graph onn vertices. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research supported in part by a USA—Israel BSF grant and by the Fund for Basic Research administered by the Israel Academy of Sciences and by the Minkowski Minerva Center for Geometry at Tel Aviv University.This work was partly done while the author was at XEROX PARC and partly at DIMACS.     

Sommes D'Exponentielles et Entiers Sans Grand Facteur Premier

Let S(x,y) be the set S(x,y)= 1 n x : P(n) y, where P(n) denotesthe largest prime factor of n. We study , where f is a multiplicative function. When f=1and when f=µ, we widen the domain of uniform approximationusing the method of Fouvry and Tenenbaum and making explicitthe contribution of the Siegel zero. Soit S(x,y) l'ensemble S(x,y)= 1 n x : P(n) y, désigne le plus grand facteur premier den. Nous étudions , lorsque f est une fonction multiplicative. Quand f=1 et quand f=µ,nous élargissons le domaine d'approximation uniformeenutilisant la méthode développée par Fouvryet Tenenbaum et en explicitant la contribution du zérode Siegel. 1991 Mathematics Subject Classification: 11N25, 11N99.     

Some theta function identities related to the Rogers-Ramanujan continued fraction

In his first and second letters to Hardy, Ramanujan made several assertions about the Rogers-Ramanujan continued fraction . In order to prove some of these claims, G. N. Watson established two important theorems about that he found in Ramanujan's notebooks. In his lost notebook, after stating a version of the quintuple product identity, Ramanujan offers three theta function identities, two of which contain as special cases the celebrated two theorems of Ramanujan proved by Watson. Using addition formulas, the quintuple product identity, and a new general product formula for theta functions, we prove these three identities of Ramanujan from his lost notebooks.

     

Multicoloring and Mycielski construction

The generalized Mycielskians of graphs (also known as cones over graphs) are the natural generalization of the Mycielskians of graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer p?0, one can transform G into a new graph μ_p(G), the p-Mycielskian of G. In this paper, we study the kth chromatic numbers χ_k of Mycielskians and generalized Mycielskians of graphs. We show that χ_k(G)+1?χ_k(μ(G))?χ_k(G)+k, where both upper and lower bounds are attainable. We then investigate the kth chromatic number of Mycielskians of cycles and determine the kth chromatic number of p-Mycielskian of a complete graph K_n for any integers k?1, p?0 and n?2. Finally, we prove that if a graph G is a/b-colorable then the p-Mycielskian of G, μ_p(G), is (at+b^p+1)/bt-colorable, where . And thus obtain graphs G with m(G) grows exponentially with the order of G, where m(G) is the minimal denominator of a a/b-coloring of G with χ_f(G)=a/b.