On the class number of p-th cyclotomic field

Let h^[-(p)h^-(p) be the relative class number of the p-th cyclotomic field. We show that logh^-(p) = [(p+3)/4] logp - [(p)/2] log2p+ log(1-b) + O(log₂² p)\log h^-(p) = {{p+3} \over {4}} \log p - {{p} \over {2}} \log 2\pi + \log (1-\beta ) + O(\log _2^2 p), where b\beta denotes a Siegel zero, if such a zero exists and p o -1 mod 4p\equiv -1\pmod {4}. Otherwise this term does not appear.     

The first factor of the class number of the p-th cyclotomic field

Kummer’s conjecture states that the relative class number of the p-th cyclotomic field follows a strict asymptotic law. Granville has shown it unlikely to be true—it cannot be true if we assume the truth of two other widely believed conjectures. We establish a new bound for the error term in Kummer’s conjecture, and more precisely we prove that ${\log(h_p^-)=\frac{p+3}{4} \log p +\frac{p}{2}\log(2\pi)+\log(1-\beta)+O(\log_2 p)}$ , where β is a possible Siegel zero of an ${L(s,\chi), \chi}$ odd.     

On the size of the first factor of the class number of a cyclotomic field

Summary We show that Kummer's conjectured asymptotic estimate for the size of the first factor of the class number of a cyclotomic field is untrue under the assumption of two well-known and widely believed conjectures of analytic number theory.     

The class number of cyclotomic function fields

Let k be a rational function field over a finite field. Carlitz and Hayes have described a family of extensions of k which are analogous to the collection of cyclotomic extensions {Q(ζm)| m ≥ 2} of the rational field Q. We investigate arithmetic properties of these “cyclotomic function fields.” We introduce the notion of the maximal real subfield of the cyclotomic function field and develop class number formulas for both the cyclotomic function field and its maximal real subfield. Our principal result is the analogue of a classical theorem of Kummer which for a prime p and positive integer n relates the class number of Q(ζpn + ζpn?1), the maximal real subfield of Q(ζpn), to the index of the group of cyclotomic units in the full unit group of Z[ζpn].     

About the maximal rank of 3-tensors over the real and the complex number field

Tensor data are becoming important recently in various application fields. In this paper, we consider the maximal rank problem of 3-tensors and extend Atkinson and Stephens’ and Atkinson and Lloyd’s results over the real number field. We also prove the assertion of Atkinson and Stephens: ${{\rm max.rank}_{\mathbb{R}}(m,n,p) \leq m+\lfloor p/2\rfloor n}$ , ${{\rm max.rank}_{\mathbb{R}}(n,n,p) \leq (p+1)n/2}$ if p is even, ${{\rm max.rank}_{\mathbb{F}}(n,n,3)\leq 2n-1}$ if ${\mathbb{F}=\mathbb{C}}$ or n is odd, and ${{\rm max.rank}_{\mathbb{F}}(m,n,3)\leq m+n-1}$ if m < n where ${\mathbb{F}}$ stands for ${\mathbb{R}}$ or ${\mathbb{C}}$ .     

Mean value of L-functions and the number of classes of a cyclotomic field

The Paley-Selberg asymptotic formula is refined to the form

On the first factor of the class number of prime cyclotomic fields

Let H(l) be the first factor of the class number of the field $\text{Q}$(exp 2πi/l), l a prime. The best-known upper and lower bounds on H(l) are improved for small l. The methods would also improve the best-known bounds for large l. It is shown that H(l) is the absolute value of the determinant of an easily written down matrix whose only entries are 0 and 1. The upper bounds obtained on H(l) significantly improve the Hadamard bound on the determinant of this matrix. Results of Lehmer on the factors of H(l) are explained via class field theory.     

An Optimization algorithm computing the maximal singular number of a real matrix

The problem of calculating the maximal singular number of a given real matrix is considered. The existing solution methods are briefly surveyed. A new optimization-type algorithm for computing the maximal singular number is suggested and substantiated. Its rate of convergence is proved to be linear. A relationship between the row sums of the matrix and one of its singular numbers is established, and new localization theorems are proved. It is shown how the suggested algorithm is related to the Relay relation relaxation method. Exceptional situations in which the algorithm converges to a non-maximal singular number are described. A computational trick for avoiding such situations with fairly high reliability is suggested.     

The parity of the class number of the cyclotomic fields of prime conductor

Using a duality result for cyclotomic units proved by G.Gras, we derive a relation between the vanishing of some -components of the ideal class groups of abelian fields of prime conductor (Theorem 1). As a consequence, we obtain a criterion for the parity of the class number of any abelian number field of prime conductor.

     

Theta series of a real algebraic number field

We investigate transformation formulas for theta series with spherical functions on a Hilbert-Siegel space. As an application we show that some of Hilbert-Siegel modular varieties are of general type.     

On the ideal class groups of the maximal real subfields of number fields with all roots of unity

In this paper, for a totally real number field k we show the ideal class group of k(∪_n>0μ_n)⁺ is trivial. We also study the p-component of the ideal class group of the cyclotomic Z_p-extension. Received January 15, 1998 / final version received July 31, 1998     

Some presentations of the real number field

It is proved that every two Σ-presentations of an ordered field \mathbbR \mathbb{R} of reals over \mathbbH\mathbbF ( \mathbbR ) \mathbb{H}\mathbb{F}\,\left( \mathbb{R} \right) , whose universes are subsets of \mathbbR \mathbb{R} , are mutually Σ-isomorphic. As a consequence, for a series of functions f:\mathbbR ? \mathbbR f:\mathbb{R} \to \mathbb{R} (e.g., exp, sin, cos, ln), it is stated that the structure \mathbbR \mathbb{R} = 〈R, +, ×, <, 0, 1, f〉 lacks such Σ-presentations over \mathbbH\mathbbF ( \mathbbR ) \mathbb{H}\mathbb{F}\,\left( \mathbb{R} \right) .     

The class reconstruction number of maximal planar graphs

The reconstruction numberrn(G) of a graphG was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphsG _i =G – v _i in the deck ofG which do not all appear in the deck of any other graph. For any graph theoretic propertyP, Harary defined theP-reconstruction number of a graph G P as the smallest number of theG _i in the deck ofG, which do not all appear in the deck of any other graph inP We now study the maximal planar graph reconstruction numberrn(G), proving that its value is either 1 or 2 and characterizing those with value 1.