An elementary proof of the irrationality of ζ(3)

An elementary proof of the irrationality of ζ(3) is presented. The proof is based on a two times more dense sequence of Diophantine approximations to this number than the sequence in the original proof of Apery.     

Sums of the error term function in the mean square for ζ(s)

Sums of the form are investigated, where is the error term in the mean square formula for . The emphasis is on the case k = 1, which is more difficult than the corresponding sum for the divisor problem. The analysis requires bounds for the irrationality measure of e^2πm and for the partial quotients in its continued fraction expansion. Authors’ addresses: Y. Bugeaud, Université Louis Pasteur, Mathématiques, 7 rue René Descartes, F-67084 Strasbourg cedex, France; A. Ivić, Katedra Matematike RGF-a, Universitet u Beogradu, Đušina 7, 11000 Beograd, Serbia     

Higher Secant Varieties of ℙ n × ℙ1 Embedded in Bi-Degree (a,b)

In this article, we compute the dimension of all the higher secant varieties to the Segre–Veronese embedding of ? ⁿ × ?¹ via the section of the sheaf 𝒪(a, b) for any n, a, b ∈ ?⁺. We relate this result to the Grassmann Defectivity of Veronese varieties and we classify all the Grassmann (1, s ? 1)-defective Veronese varieties.     

Fast Computation of ζ(3) and of Some Special Integrals Using the Ramanujan Formula and Polylogarithms

The application of the Fast E-function Evaluation (FEE) method to fast calculation of the value of (3) and of some special integrals on the basis of the Ramanujan formula and its generalization is considered.This revised version was published online in October 2005 with corrections to the Cover Date.     

The normalizer of γ1(N) in psl2(R)

We find the full normalizer of γ₁(N) in psl₂(R).     

The connection between the zeros of the ζ-function and sequences(g(p)), p prime,mod 1

In this paper we give the connection between the zeros of the -function and sequences(g(p)), p prime, mod 1 ifg(x)=x for 0, >0 or ifg(X) is a polynomial in .     

The Missing Boundaries of the Santaló Diagrams for the Cases (d,ω, R ) and (ω ,R,r )

In this paper we solve two open problems posed by Santaló: to obtain complete systems of inequalities for some triples of measures of a planar convex set. Received February 17, 1999, and in revised form July 15, 1999.     

On the Global Pinching Theorem for the Minimal Submanifolds in the Unit Spheres S~(n+p)(1)

J.Simons proved that if a minimal submanifold,M~n in the unit sphere S~(n+p)(1)satisfies,|B|~2相似文献   

Small representations of the relation algebra ɛn+1(1, 2, 3)

Applying combinatorial methods, we prove that the symmetric relation algebra _n+1(1, 2, 3) ofn+1 atoms is finitely representable for alln 1, on at most (2+o(1))n² elements asn . We explicitly construct a representation of size 4.5n², for every n >1.Presented by B. Jonsson.     

Reuse,Recycle, Reduce (3R) – strategies for the calculation of transient magnetic fields

The discretization of transient magneto-dynamic field problems with geometric discretization schemes such as the Finite Integration Technique or the Finite-Element Method based on Whitney form functions results in nonlinear differential-algebraic systems of equations of index 1. Their time integration with embedded s-stage singly diagonal implicit Runge–Kutta methods requires the solution of s nonlinear systems within one time step. Accelerated solution of these schemes is achieved with techniques following so-called 3R-strategies (“reuse, recycle, reduce”). This involves e.g. the solution of the linear(-ized) equations in each time step where the solution process of the iterative preconditioned conjugate gradient method reuses and recycles spectral information of linear systems from previous stages. Additionally, a combination of an error controlled spatial adaptivity and an error controlled implicit Runge–Kutta scheme is used to reduce the number of unknowns for the algebraic problems effectively and to avoid unnecessary fine grid resolutions both in space and time. First numerical results for 2D nonlinear magneto-dynamic problems validate the presented approach and its implementation. The space discretization in the numerical examples is done by Lagrangian nodal finite elements but the presented algorithms also work in combination with other discretization schemes for the Maxwell equations such as the Whitney vector finite elements.     

On the Evaluation of the Tutte Polynomial at the Points (1, –1) and (2, –1)

Motivated by the identity t (K _n+2; 1, –1) = t (K _n ; 2, –1), where t(G; x, y) is the Tutte polynomial of a graph G, we search for graphs G having the property that there is a pair of vertices u, v such that t(G; 1, –1) = t(G – {u, v}; 2, –1). Our main result gives a sufficient condition for a graph to have this property; moreover, it describes the graphs for which the property still holds when each vertex is replaced by a clique or a coclique of arbitrary order. In particular, we show that the property holds for the class of threshold graphs, a well-studied class of perfect graphs.     

Calculating the Fundamental Group of Galois Cover of the(2, 3)-embedding of CP~1× T

As known to all,it is quite difficult to compute the fundamental group of a surface of general type.In this paper,applying Moishezon-Teicher's algorithm,we investigate the fundamental group of a special surface of general type with zero topological index,namely,the Galois cover of the(2,3)-embedding of CP~1×T.Because the full presentation of the group is very complicated,we compute its special quotient and get an interesting result about its structure.     

On the Relationship between the Multidimensional Dirichlet Divisor Problem and the Boundary of Zeros of ζ(s)F

Mathematical Notes -