Combining triple diagonal forms

Let R be a Euclidean domain with quotient field F of characteristic not equaling 2. Jacobi showed that every symmetric R-matrix is congruent over R to a matrix in triple diagonal form. Since it is generally not possible to fully diagonalize these matrices, it is of importance to gain as much control as possible of this triple diagonal form. Two different refinements have since been made to Jacobi’s triple diagonal form. This paper works toward combining these refinements.     

Fast inversion algorithms for diagonal plus semiseparable matrices

Here are considered matrices represented as a sum of diagonal and semiseparable ones. These matrices belong to the class of structured matrices which arises in numerous applications. FastO(N) algorithms for their inversion were developed before under additional restrictions which are a source of instability. Our aim is to eliminate these restrictions and to develop reliable and stable numerical algorithms. In this paper we obtain such algorithms with the only requirement that the considered matrix is invertible and its determinant is not close to zero. The case of semiseparable matrices of order one was considered in detail in an earlier paper of the authors.     

When do abstract bases generate continuous lattices and L-domains

In this note, the new concepts of C-bases (resp., BC-bases, L-bases) which are special kinds of abstract bases are introduced. It is proved that the round ideal completion of a C-basis (resp., BC-basis, L-basis) is a continuous lattice (resp., bc-domain, L-domain). Furthermore, representation theorems of continuous lattices (resp., bc-domains, L-domains) by means of the round ideal completions of C-bases (resp., BC-bases, L-bases) are obtained. Supported by the NSF of China (10371106, 60774073) and by the Fund (S0667-082) from Nanjing University of Aeronautics and Astronautics.     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

An efficient algorithm for the Hurwitz zeta and related functions

A simple class of algorithms for the efficient computation of the Hurwitz zeta and related special functions is given. The algorithms also provide a means of computing fundamental mathematical constants to arbitrary precision. A number of extensions as well as numerical examples are briefly described. The algorithms are easy to implement and compete with Euler–Maclaurin summation-based methods.     

On some series representations of the Hurwitz zeta function

A variety of infinite series representations for the Hurwitz zeta function are obtained. Particular cases recover known results, while others are new. Specialization of the series representations apply to the Riemann zeta function, leading to additional results. The method is briefly extended to the Lerch zeta function. Most of the series representations exhibit fast convergence, making them attractive for the computation of special functions and fundamental constants.     

Lattices and infinite-dimensional forms. ‘The Lattice Method’

Hermitean vector spaces E of infinite dimensions are considered. Let G be a subgroup of the orthogonal group of E acting on a set M. The Lattice Method is a technique for classifying the orbits in M under G. We discuss the method in abstract terms and we illustrate it by means of three classification results showing that it is decisive to do a considerable amount of explicit calculations with vector subspace lattices.     

Reducibility number

Let P be a poset in a class of posets P. A smallest positive integer r is called reducibility number of P with respect to P if there exists a non-empty subset S of P with |S|=r and P-S∈P. The reducibility numbers for the power set 2ⁿ of an n-set (n?2) with respect to the classes of distributive lattices, modular lattices and Boolean lattices are calculated. Also, it is shown that the reducibility number r of the lattice of all subgroups of a finite group G with respect to the class of all distributive lattices is 1 if and only if the order of G has at most two distinct prime divisors; further if r is a prime number then order of G is divisible by exactly three distinct primes. The class of pseudo-complemented u-posets is shown to be reducible. Deletable elements in semidistributive posets are characterized.     

On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function

Summary We study a class of generalized gamma functions _k (z) which relate to the generalized Euler constants _k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for _k is derived, and the constant term in the asymptotic expansion for log _k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.     

On the periodicity of Coxeter transformations and the non-negativity of their Euler forms

We show that for piecewise hereditary algebras, the periodicity of the Coxeter transformation implies the non-negativity of the Euler form. Contrary to previous assumptions, the condition of piecewise heredity cannot be omitted, even for triangular algebras, as demonstrated by incidence algebras of posets.We also give a simple, direct proof, that certain products of reflections, defined for any square matrix A with 2 on its main diagonal, and in particular the Coxeter transformation corresponding to a generalized Cartan matrix, can be expressed as , where A₊, A_- are closely associated with the upper and lower triangular parts of A.     

On the proof of humbert’s volume formula

We close a gap in Humbert’s classical calculation of the volume of the quotient of three-dimensional hyperbolic space by SL₂ over the ring of integers of an imaginary quadratic number field.     

On the error term in the mean square formula for the Riemann zeta-function in the critical strip

For 1/2<<1 fixed, letE (T) denote the error term in the asymptotic formula for . We obtain some new bounds forE (T), and an _-result which is the analogue of the strongest _-result in the classical Dirichlet divisor problem.     

Smith normal form of augmented degree matrix and its applications

We use the Smith normal form of augmented degree matrix to count the number of rational points of a hypersurface (or an algebraic set) over finite fields, which generalizes the results obtained previously.     

Mahler measures in a field are dense modulo 1

Let K be a number field. We prove that the set of Mahler measures M(α), where α runs over every element of K, modulo 1 is everywhere dense in [0, 1], except when or , where D is a positive integer. In the proof, we use a certain sequence of shifted Pisot numbers (or complex Pisot numbers) in K and show that the corresponding sequence of their Mahler measures modulo 1 is uniformly distributed in [0, 1]. Received: 24 March 2006     

Omega result for the mean square of the Riemann zeta function

A recent method of Soundararajan enables one to obtain improved Ω-result for finite series of the form ∑_nf(n) cos (2πλ_nx+β) where 0≤λ₁≤λ₂≤. . . and β are real numbers and the coefficients f(n) are all non-negative. In this paper, Soundararajan’s method is adapted to obtain improved Ω-result for E(t), the remainder term in the mean-square formula for the Riemann zeta-function on the critical line. The Atkinson series for E(t) is of the above type, but with an oscillating factor (−1)ⁿ attached to each of its terms.     

Simple zeros and discrete moments of the derivative of the Riemann zeta-function

We prove unconditional upper bounds for the second and fourth discrete moment of the first derivative of the zeta-function at its simple zeros on the critical line.