On higher order Stickelberger-type theorems

We discuss an explicit refinement of Rubin?s integral version of Stark?s conjecture. We prove that this refinement is a consequence of the relevant case of the Equivariant Tamagawa Number Conjecture of Burns and Flach, hence obtaining a full proof in several important cases. We also derive several explicit consequences of this refinement concerning the annihilation as Galois modules of ideal class groups by explicit elements constructed from the values of higher order derivatives of Dirichlet L-functions. We finally describe the relation between our approach and those found in recent work of Emmons and Popescu and of Buckingham.     

Nakai's conjecture for varieties smoothed by normalization

The notion of D-simplicity is used to give a short proof that varieties whose normalization is smooth satisfy Ishibashi's extension of Nakai's conjecture to arbitrary characteristic. This gives a new proof of Nakai's conjecture for curves and Stanley-Reisner rings.

     

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.     

Bounds and inequalities for single server loss systems

We consider a single server loss system in which arrivals occur according to a doubly stochastic Poisson process with a stationary ergodic intensity functionλ _t . The service times are independent, exponentially distributed r.v.'s with meanμ ⁻¹, and are independent of arrivals. We obtain monotonicity results for loss probabilities under time scaling as well as under amplitude scaling ofλ _t . Moreover, using these results we obtain both lower and upper bounds for the loss probability.     

Petits points et conjecture de Bogomolov

This paper is devoted to the statement known as the Bogomolov conjecture on small points. We present the outline of Zhang's proof of the generalized version of the conjecture. An explicit bound for the height of a non-torsion variety of an abelian variety is obtained in the frame of Arakelov theory. Some further developments are mentioned.     

On matrix analogs of Fermat’s little theorem

The theorem proved in this paper gives a congruence for the traces of powers of an algebraic integer for the case in which the exponent of the power is a prime power. The theorem implies a congruence in Gauss’ form for the traces of the sums of powers of algebraic integers, generalizing many familiar versions of Fermat’s little theorem. Applied to the traces of integer matrices, this gives a proof of Arnold’s conjecture about the congruence of the traces of powers of such matrices for the case in which the exponent of the power is a prime power.     

Floer–Novikov cohomology and the flux conjecture

We study Floer–Novikov cohomology with local coefficients and prove the flux conjecture for general closed symplectic manifolds. Received: February 2005, Revised: May 2006, Accepted: May 2006 Partially supported by the Grant-in-Aid for Scientific Research No. 14003419, Japan Society for the Promotion of Sciences.     

THE WEINSTEIN CONJECTURE ON C~1-SMOOTH HYPERSURFACE OF CONTACT TYPE

In this note a symplectic capacity of Hofer-Zehnder type that is only invariant under C1-symplectomorphisms is defined and all computation formulae for Hofer-Zehnder symplectic capacity obtained at present are proved still holding for it. As a consequence some results on Weinstein conjecture are generalized to C1-smooth hypersurface of contact type.     

ContributionsChromatic Ramsey numbers

Suppose G is a graph. The chromatic Ramsey number r_c(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let M_n = min[r_c(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that M_n = (n − 1)² + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M₆ and M₇.     

ON THE BOUNDEDNESS OF A CERTAIN SYSTEM OF FIFTH-ORDER DIFFERENTIAL EQUATION

１ＩｎｔｒｏｄｕｃｔｉｏｎＷｅｓｈａｌｂｅｃｏｎｃｅｒｎｅｄｈｅｒｅｗｉｔｈｒｅａｌｆｉｆｔｈｏｒｄｅｒｖｅｃｔｏｒｄｉｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎｏｆｔｈｅｆｏｒｍ：Ｘ（５）＋Ｆ（Ｘ．．）Ｘ（４）＋Φ（Ｘ．．）＋Ｇ（Ｘ．．）＋Ｈ（Ｘ．）＋Ψ...