text:
# Introduction

## Introduction

This is a work on perspective.
In the survey I want to discuss algebraic and computer algebra aspects of vector bundles, foliations and zeta functions from commutative and noncommutative geometry points of view. I shall do it on the base of some parts of papers of A. Connes , H. Moriyoshi  and N. Nekrasov and A. Schwarz  on noncommutative torus, operator algebras, and instantons on noncommutative $`𝐑^4`$, of A. Connes and D. Kreimer  on renormalization and the Hopf algebra structure of graphs and D. Broadhurst and D. Kreimer  on renormalization automated by Hopf algebra. Algebraic varieties appears in many mathematical and physical problems (strings as algebraic curves, some Calabi-Yau manifolds). So I want mention some novel papers on computer algebra  which have strong connections with algebraic geometric.
In section 1 we give formulae for computation of local charts, tangent bundles and transition functions of two dimensional sphere. These formulae (and some formulae of the next subsection) can be implemented on computer algebra systems (Reduce, Maple) straightforward. Most formulae are tested by author on different versions of Reduce and Maple. Then we discuss vector bundles over algebraic curves, Kronecker foliation, formal groups, moduli spaces and connections.
As have noted by A. Connes , there is ”a spectral interpretation of zeros of zeta and L-functions in terms of constructions involving adeles, more specifically the noncommutative space of adele classes”. In section 2 we give formulae for computation of values of some zeta and L-functions.
Section 3 presents very short discussion of the algebraic context of noncommutative geometry.
For some problems it is necessary to programming them from the beginning (elementary data stuctures, efficient algorithm). A useful standpoint of solving a variety of problems is to model them in terms of some graphs (still 1959 F. Harary has proposed a graph method for complete reduction of a matrix with a view toward finding its eigenvalues ). These include trees, branching and connectivity with cutset of graphs, covering problems, networks and flows, matching and maximal matching. Graphs can modeling commutative diagrams and complexes as well as Feynman diagrams. Under interaction of strings manifolds of varying dimension can appear. Solving differential equations on the manifolds by an iterative method (for instance, by Newton map $`N_f(x)=x[Df(x)]^1f(x)`$) we have to compute Jacobian. The efficien algorithm can be implemented by the cutset method. In the Appendix we give our implementation of the cutset algorithm.
Side by side with works of above-mentioned authors, the survey based on my talks on SCAN2000 , Banach Center (Warsaw) conference , SAGP’99 (Luminy, France), IMACS-ACA , Mittag-Leffler seminar ”Geometry and Physics” (1998), Math. Institute of Stockholm University seminar ”Algebra and Geometry” , Dubna’98  and on SNADE’97 .
So the purpose of the talk is two-fold: first to review algebraic geometric and computer algebra aspects of vector bundles, foliations and zeta functions; second to disscuss some noncommutative context of the structures and methods in the frame of algebraic and analytic computations.

## 1 Geometry, Topology and Dynamics

As elements of differential geometry  and differential topology  play an important role in our consideration we recall for spesialists in computer science notions of local charts, atlases, differentiable manifold and tangent bundles by the example of two dimensional sphere $`S^2:x_1^2+x_2^2+x_3^2=1`$.
Local charts as half-spheres of $`S^2`$.
In the case local charts are $`(U_i,\phi _i)`$, where

$$x=(x_1,x_2,x_3),U_i=(xS^2:x_i>0),U_{3+i}=(xS^2:x_i<0),$$

$`i=1,2,3;_{j=1}^6U_j=S^2`$ and maps $`\phi _i:U_i𝐑^2`$ are follows

$$\phi _1(x_2,x_3):u_1=x_2,u_2=x_3;$$

$$\phi _2(x_1,x_3):v_1=x_1,v_2=x_3;$$

$$\phi _2^1(v_1,v_2)=(v_1,\sqrt{1v_1^2v_2^2},v_2);$$

$$\phi _3(x_1,x_2):w_1=x_1,w_2=x_2;$$

Maps $`\phi _4,\phi _5,\phi _6`$ are defined by symmetry.
The intersection $`U_1U_2\mathrm{}.`$ So

$$\phi _1(x_2,x_3)=(u_1,u_2),\phi _2(x_1,x_3)=(v_1,v_2).$$

and the map

$$\phi _1\phi _2^1=(u_2=v_2,u_1=\sqrt{1v_1^2v_2^2})$$

is a $`C^r`$ diffeomorphism between open sets $`\phi _1(U_1U_2)`$ and $`\phi _2(U_1U_2).`$ The diffeomorphism $`\phi _1\phi _2^1`$ is called the changes of coordinates.
Local charts and stereographics projection of $`S^2`$.
In the case there are two charts

$$U_1=(S^2(0,0,1)\phi _1=(\frac{x_1}{1x_3},\frac{x_2}{1x_3}))$$

and

$$U_2=(S^2(0,0,1)\phi _2=(\frac{x_1}{1+x_3},\frac{x_2}{1+x_3}))$$

Now

$$U_1U_2=(xS^2|x_3|<1).$$

Let $`(u_1,u_2),(v_1,v_2)`$ be local coordinates at $`U_1,U_2`$ respectively. In the intersection $`U_1U_2`$

$$\phi _1^1=(\frac{2u_1}{u_1^2+u_2^2+1},\frac{2u_2}{u_1^2+u_2^2+1},\frac{u_1^2+u_2^21}{u_1^2+u_2^2+1}),$$

$$\phi _2^1=(\frac{2v_1}{v_1^2+v_2^2+1},\frac{2v_2}{v_1^2+v_2^2+1},\frac{1v_1^2u_2^2}{v_1^2+v_2^2+1}),$$

and in the case
$`\phi _1\phi _2^1(v_1,v_2)=(v_1,v_2),`$ and $`\phi _2\phi _1^1(u_1,u_2)=(u_1,u_2),`$
Again we have diffeomorphisms between $`\phi _1(U_1U_2)`$ and $`\phi _2(U_1U_2).`$
Tangent bundles of one and two-spheres $`S^1`$ and $`S^2`$ .
Here we recall tangent bundles of $`S^1`$ and $`S^2`$ . In both cases the tangent bundle is a differentiable manifold. Tangent bundle $`TS^1`$ of $`S^1`$ is the product $`S^1\times 𝐑`$. Therefore $`TS^1`$ is a trivial bundle and manifold $`S^1`$ is parallelizable.
Tangent bundle $`TS^2`$ of $`S^2`$ can be defined by 3 local charts (in the sense of vector bundles; see below). Let $`U_i=(xS^2||x_i|<1).`$ Then $`_{i=1}^3U_i=S^2.`$ Let $`E`$ be the set $`(x,t)`$ in $`𝐑^3\times 𝐑^3`$ with $`xS^2`$ as above and $`t=(u,v,w)`$ such that scalar product $`<x,t>=0.`$ Let $`p:(x,t)x`$ be the projection $`E`$ on $`S^2.`$ Homeomorphisms

$$\mathrm{\Phi }_1:p^1(U_1)(U_1\times 𝐑^2)$$

$$(x_1,x_2,x_3;u,v,w)(x_1,x_2,x_3;vx_3wx_2,u),$$

$$\mathrm{\Phi }_2:p^1(U_2)(U_2\times 𝐑^2)$$

$$(x_1,x_2,x_3;u,v,w)(x_1,x_2,x_3;wx_1ux_3,v),$$

$$\mathrm{\Phi }_3:p^1(U_3)(U_3\times 𝐑^2)$$

$$(x_1,x_2,x_3;u,v,w)(x_1,x_2,x_3;ux_3vx_2,w),$$

define atlas $`(U_i,\mathrm{\Phi }_i)`$ of tangent bundle $`TS^2.`$ There is well known fact that $`TS^2`$ is not trivial bundle and therefore the manifold $`S^2`$ is not parallelizable.
The above tangent bundles of spheres are really vector bundles. This means that in the case of $`S^2`$ there are unique continuous mappings

$$g_{ij}:U_iU_jGL(2,𝐑),$$

such that the mapping

$$\psi _{ij}=\mathrm{\Phi }_i\mathrm{\Phi }_j^1:(U_iU_j)\times 𝐑^2(U_iU_j)\times 𝐑^2,$$

satisfies $`\psi _{ij}=(x,g_{ij}(x)y)`$ for every $`(x,y)(U_iU_j)\times 𝐑^2.`$ In the case $`TS^2`$ the transition functions $`g_{ij}`$ are follows:

$$g_{21}(x)=\frac{1}{x_2^2+x_3^2}\left|\begin{array}{cc}x_1x_2& x_3\\ x_3& x_1x_2\end{array}\right|,$$

$$g_{32}(x)=\frac{1}{x_1^2+x_3^2}\left|\begin{array}{cc}x_2x_3& x_1\\ x_1& x_2x_3\end{array}\right|,$$

$$g_{13}(x)=\frac{1}{x_1^2+x_2^2}\left|\begin{array}{cc}x_1x_3& x_2\\ x_2& x_1x_3\end{array}\right|.$$

### 1.1 Vector Bundles

More generally we can give a manifold by charts and local diffeomorphisms. Local chart or a system of coordinates on a topological space $`M`$ is a pair $`(U,\phi )`$ where $`U`$ is an open set in $`M`$ and $`\phi :U𝐑^m`$ is a homeomorphism from $`U`$ to an open set $`\phi (U)`$ in $`𝐑^m`$. An atlas $`\mathrm{\Phi }`$ of dimension $`m`$ is a collection of local charts whose domains cover $`M`$ and such that if $`(U,\phi ),(U_1,\phi _1)\mathrm{\Phi }`$ and $`UU_10`$ then the map

$$\phi _1\phi ^1:\phi (UU_1)\phi _1(UU_1)$$

is a $`C^r`$-diffeomorphism between open sets in $`𝐑^m`$.
Fibre space is the object $`(E,p,B)`$, where $`p`$ is the continuous surjective (= on) mapping of a topological space $`E`$ onto a space $`B`$ (in our consideration $`B=M`$ is a differential manifold), and $`p^1(b)`$ is called the fibre above $`bB`$. Both the notation $`p:EB`$ and $`(E,p,B)`$ are used to denote a fibration, a fibre space, a fibre bundle or a bundle.
Vector bundle is fibre space each fibre $`p^1(b)`$ of which is endowed with the structure of a (finite dimension) vector space $`V`$ over skew-field $`K`$ such that the following local triviality condition is satisfied: each point $`bB`$ has an open neighborhood $`U`$ and a $`V`$ -isomorphism of fibre bundles $`\varphi :p^1(U)U\times V`$ such that $`\varphi _{p^1(b)}:p^1(b)b\times V`$ is an isomorphism of vector spaces for each $`bB`$.
$`dimV`$ is said to be the dimension of the vector bundle.
An Hermitian bundle over algebraic variety $`X`$ consists of a vector bundle over $`X`$ and a choice of $`C^{\mathrm{}}`$ Hermitian metric on the vector bundle over complex manifold $`X(𝐂)`$, which is invariant under antiholomorphic involution of $`X(𝐂)`$.

Tangent bundle .
The tangent space to a differentiable manifold $`M`$ at point $`aM`$ can be defined as the set of tangency classes of smooth paths in $`M`$ based at $`a`$. It will be denoted by $`T_aM.`$ Elements of $`T_aM`$ are called tangent vectors to $`M`$ at $`a`$.
The tangent bundle of $`M`$, denoted by $`TM`$, is the union of the tangent spaces at all the points of $`M.`$ By well known way $`TM`$ can be made into a smooth manifold.
Recall well known facts about $`TM:`$
(i) if $`M`$ is $`C^r`$ then $`TM`$ is $`C^{r1};`$
(ii) if $`M`$ is $`C^{\mathrm{}}`$ or $`C^\omega `$ then the same holds for $`TM`$;
(iii) if $`M`$ has dimension $`n`$ then $`TM`$ has dimension $`2n`$;
(iv) there is a natural map $`p:TMM`$ called the projection map, taking $`T_aM`$ to $`a`$ for each $`a`$ in $`M`$, i.e. $`p`$ takes all tangent vectors at $`a`$ to the point $`a`$ itself. Thus $`p^1(a)=T_aM`$ (fibre of the bundle over $`a`$). The projection $`p`$ is a smooth map $`C^{r1}`$ if $`M`$ is $`C^r;`$
Vector fields and Flows.
A vector field on a smooth manifold $`M`$ is a map $`F:MTM`$ which satisfies $`pF=id_M`$, where $`p`$ is the natural projection $`TMM.`$ By its definition a vector field is a section of the bundle $`TM.`$
Let $`F`$ be a vector field on $`M`$. A solution curve to $`F`$, based at $`a`$ on $`M`$ is a path $`c:IM`$ (where $`I`$ is some open interval $`(a,b)`$ with $`a<0<b`$ ) satisfying $`c(0)=a`$ and $`T_tc=F(c(t))`$ for all $`t`$ in $`I`$. (Here $`TI=I\times 𝐑`$ and so $`T_tc`$ is a map $`𝐑TM.`$ This demonstrate the well known fact that a vector field on a manifold is the global version of a first order autonomous system of $`n`$ ordinary differential equations on $`𝐑^n.`$
Let

$$\dot{𝐱}=A𝐱,(2)$$

where $`𝐱𝐑^n`$, $`A`$ is $`n\times n`$ matrix, be a linear system of ordinary differential equations. It is well known that the solution of the system (2) together with the initial condition $`𝐱(0)=𝐱_0`$ is given by

$$𝐱(t)=e^{At}𝐱_0,$$

where $`e^{At}`$ is an $`n\times n`$ matrix function defined by its Taylor series. The mapping $`e^{At}:𝐑^n𝐑^n`$ is called the flow of linear system (2).
Recall the definition of the flow $`\varphi _t`$ of the nonlinear system

$$\dot{𝐱}=F(𝐱),(3)$$

Let $`I(𝐱_0)`$ be the maximal interval of existence of the solution $`\varphi (t,𝐱_0)`$ of (2) with the initial value $`𝐱(0)=𝐱_0.`$ Let X be an open subset of $`𝐑^n`$ and let $`FC^1(X).`$ For $`𝐱_0X,`$ let $`\varphi (t,𝐱_0)`$ be the solution of (3) with initial value problem $`𝐱(0)=𝐱_0`$ defined on its maximal interval of existence $`I(𝐱_0).`$ Then for $`tI(𝐱_0),`$ the mapping $`\varphi _t:XX`$ defined by

$$\varphi _t(𝐱_0)=\varphi (t,𝐱_0)$$

is called the flow of the differential equation (1) or the flow of the vector field F(x).

### 1.2 Vector Bundles over Projective Algebraic Curves

Let $`X`$ be a projective algebraic curve over algebraically closed field $`k`$ and $`g`$ the genus of $`X`$. Let $`𝒱(X)`$ be the category of vector bundles over $`X`$. Grothendieck have shown that for a rational curve every vector bundle is a direct sum of line bundles. Atiyah have classified vector bundles over elliptic curves. The main result is
Theorem . Let $`X`$ be an elliptic curve, $`A`$ a fixed base point on $`X`$. We may regard $`X`$ as an abelian variety with $`A`$ as the zero element. Let $`(r,d)`$ denote the the set of equivalence classes of indecomposable vector bundles over $`X`$ of dimension $`r`$ and degree $`d`$. Then each $`(r,d)`$ may be identified with $`X`$ in such a way that
$`det:(r,d)(1,d)`$ corresponds to $`H:XX,`$
where $`H(x)=hx=x+x+\mathrm{}+x(h`$ times$`)`$, and $`h=(r,d)`$ is the highest common factor of $`r`$ and $`d`$.
Curve $`X`$ is called a configuration if its normalization is a union of projective lines and all singular points of $`X`$ are simple nodes. For each configuration $`X`$ can assign a non-oriented graph $`\mathrm{\Delta }(X)`$, whose vertices are irreducible components of $`X`$, edges are its singular and an edge is incident to a vertex if the corresponding component contains the singular point. Drozd and Greuel have proved:
Theorem . 1. $`𝒱(X)`$ contains finitely many indecomposable objects up to shift and isomorphism if and only if $`X`$ is a configuration and the graph $`\mathrm{\Delta }(X)`$ is a simple chain (possibly one point if $`X=𝐏^1`$).
2. $`𝒱(X)`$ is tame, i.e. there exist at most one-parameter families of indecomposable vector bundles over $`X`$, if and only if either $`X`$ is a smooth elliptic curve or it is a configuration and the graph $`\mathrm{\Delta }(X)`$ is a simple cycle (possibly, one loop if $`X`$ is a rational curve with only one simple node).
3. Otherwise $`𝒱(X)`$ is wild, i.e. for each finitely generated $`k`$algebra $`\mathrm{\Lambda }`$ there exists a full embedding of the category of finite dimensional $`\mathrm{\Lambda }`$modules into $`𝒱(X)`$.
Let $`X`$ be an algebraic curve. How to normalize it? There are several methods, algorithms and implementations for this purpose. A new algorithm and implementation is presented in .

### 1.3  Foliations

A simplest example of foliation is a trivial $`k`$ dimensional foliation or a trivial codimension $`nk`$ foliation of Euclidean space $`𝐑^n=𝐑^k\times 𝐑^{nk},0kn:`$

$$𝐑^n=\underset{(x_{k+1},\mathrm{},x_n)}{}𝐑^k\times (x_{k+1},\mathrm{},x_n),$$

that is, $`𝐑^n`$ decomposes into a union of $`𝐑^k\times (x_{k+1},\mathrm{},x_n)`$ ’s each of which is $`C^{\mathrm{}}`$ diffeomorphic to $`𝐑^k.`$ $`𝐑^k\times (x_{k+1},\mathrm{},x_n)`$ is called a leaf of the foliation.
Still one example can be obtained from consideration of nonsingular vector fields on the torus . More generally, a nonsingular flow on a manifold corresponds to a foliation on the manifold by one dimensional leaves where the leaves are provided with Riemannian metrics and directed.
Consider vector field

$$Q(x,y)x+P(x,y)y,$$
(1)
where $`P`$ and $`Q`$ are complex polynomials of degree $`n`$ in two variables. The vector field (or corresponding dual 1-form $`\omega =P(x,y)dxQ(x,y)dy`$) gives rise to a foliation $``$ of degree $`n`$ of two dimensional projective space $`𝐏^2`$ over $`𝐂`$ by Riemann surfaces and singular points. It is naturally to ask about limit cycles and multivalued first integrals of (1) and a topology of the foliation. The investigation of (1) began in , where the case $`n=2`$ considered. For the investigation of (1) and $``$ it is naturally to introduce of algebraic geometric methods and algebraic geometric invariants . These include blow-ups, divisors, indexes of singular points, Chern classes of vector bundles over some Riemann surfaces and computation of holonomy (monodromy) groups. Already in the case of  the complex dimension of the space of coefficients of (1) is equal 12 (real dimension is equal 24). This defines the application of computer algebra in the case.

#### 1.3.1 Kronecker foliation

 Let $`\theta `$ be a irrational number. Consider a vector field $`F=x+\theta y`$ on the two dimensional torus $`T^2=𝐑/𝐙\times 𝐑/𝐙.`$ The Kronecker foliation $`_\theta `$ is defined by the flow of $`F`$ in the following way: each leaf is labeled by a point of circle $`S^1=𝐑/𝐙.`$ So the leaf space is the foliated bundle

$$(𝐑\times 𝐑/𝐙)/𝐙,(x,y)(x+1,y+\theta ),$$

where the equivalence relation on $`(x,y)𝐑\times S^1`$ is defined by

$$R_\theta (x,y)=(x,y+\theta )mod1.$$

By the foliation $`_\theta `$ the $`C^{}`$-algebra $`𝒜_\theta `$ is constracted. $`𝒜_\theta `$ is generated by a pair of unitary symbols subject to the relation

$$UV=\mathrm{exp}(2\pi i\theta )VU.$$
(2)
#### 1.3.2  Formal Groups

Formal groups was introduced by J. Dieudonne and M. Lazard around 1954. During 1968-71 and later were found interesting connections between topology and formal groups . Also was found connection between formal groups and zeta functions . There is a connection of formal groups with characteristic classes of foliations and $`K`$theory . The construction of the Grothendiesk group $`K_0`$ for algebraic monoid is rather simple . What is the $`K_0`$ functor in the case of formal groups? Let us consider a simple example.
Proposition. Let $`𝒢_k`$ be the category of commutative formal groups over field $`k`$ such that every formal group in the category is the product of one dimensional formal groups. Then $`K_0(𝒢_k)`$ is a free abelian group with infinite number of generators.

#### 1.3.3 Moduli spaces

The theory of moduli spaces  has, in recent years, become the meeting ground of several different branches of mathematics and physics - algebraic geometry, instantons, differential geometry, string theory and arithmetics. Here we recall some underlieing algebraic structures of the relation. In previous subsection we have reminded the situation with vector bundles on projective algebraic curves $`X`$. On $`X`$ any first Chern class $`c_1H^2(X,𝐙)`$ can be realized as $`c_1`$ of vector bundle of prescribed rank (dimension) $`r.`$ How to classify vector bundles over algebraic varieties of dimension more than $`1\mathrm{?}`$ This is one of important problems of algebraic geometry and the problem has closed connections with gauge theory in physics and differential geometry. Mamford  and others have formulated the problem about the determination of which cohomology classes on a projective variety can be realized as Chern classes of vector bundles? Moduli spaces are appeared in the problem. What is moduli? Classically Riemann claimed that $`3g3`$ (complex) parameters could be for Riemann surface of genus $`g`$ which would determine its conformal structure (for elliptic curves, when $`g=1,`$ it is needs one parameter). From algebraic point of view we have the following problem: given some kind of variety, classify the set of all varieties having something in common with the given one (same numerical invariants of some kind, belonging to a common algebraic family). For instance, for an elliptic curve the invariant is the modular invariant of the elliptic curve.
Let B be a class of objects. Let $`S`$ be a scheme. A family of objects parametrized by the $`S`$ is the set of objects

$$X_s:sS,X_s𝐁$$

equipped with an additional structure compatible with the structure of the base $`S`$. Parameter varieties is a class of moduli spaces. These varieties is very convenient tool for computer algebra investigation of objects that parametrized by the parameter varieties. We have used the approach for investigation of rational points of hyperelliptic curves over prime finite fields .

### 1.4 Connection

Consider the connection in the context of algebraic geometry. We shall base at one I. Shafarevitch’s seminar on algebraic geometry. Let $`S/k`$ be the smooth scheme over field $`k`$, $`U`$ an element of open covering of $`S`$, $`𝒪_S`$ the structure sheaf on $`S`$, $`\mathrm{\Gamma }(U,𝒪_S)`$ the sections of $`𝒪_S`$ on $`U`$. Let $`\mathrm{\Omega }_{S/k}^1`$ be the sheaf of germs of $`1`$dimension differentials, $``$ be a coherent sheaf. The connection on the sheaf $``$ is the sheaf homomorphism

$$:\mathrm{\Omega }_{S/k}^1,$$

such that, if $`f\mathrm{\Gamma }(U,𝒪_S),g\mathrm{\Gamma }(U,)`$ then

$$(fg)=f(g)+dfg.$$

There is the dual definition. Let $``$ be the locally free sheaf, $`\mathrm{\Theta }_{S/k}^1`$ the dual to sheaf $`\mathrm{\Omega }_{S/k}^1`$, $`\mathrm{\Gamma }(U,\mathrm{\Theta }_{S/k}^1)`$. The connection is the homomorphism

$$\rho :\mathrm{\Theta }_{S/k}^1End_{𝒪_S}(,).\rho ()(fg)=(f)g+f\rho ().$$

#### 1.4.1 Integration of connection

Let $`\mathrm{\Omega }_{S/k}^i`$ be the sheaf of germs of $`i`$differentials,

$$^i(\alpha f)=d\alpha f+(1)^i\alpha (f)$$

Then $`,^i`$ define the sequence of homomorphisms:

$$\mathrm{\Omega }_{S/k}^1\mathrm{\Omega }_{S/k}^2\mathrm{},$$
(3)
A connection is integrable if (3) is a complex. This is equivalent to $`^1=0.`$

## 2  Zeta Functions

We have considered some validated numerics aspects of evaluation of zeta functions in papers . Here we shall consider some computer algebra aspects of computation and evaluation of values of zeta functions.

### 2.1 Riemann zeta

Consider the series $`\zeta (s)=_n\frac{1}{n^s}`$ for complex values of $`s`$ with $`Re(s)1.`$ Analytical formula for computation of values of the $`\zeta (s)`$ can be taken from the result of Backlund (a little bit reformulated). The result is based of Euler-Maclaurin summation.
Proposition (Backlund) Let $`N`$ be natural $`>1.`$ Let $`s=\sigma +it`$ and let $`\sigma 1.`$ Let $`B_{2k}`$ be the Bernoulli numbers in even numeration,
$`S(N1,s)=_{n=1}^{N1}n^s+\frac{N^{1s}}{s1},B(N,k,s)=\frac{1}{2}N^s+\frac{B_2}{2}sN^{s1}+\mathrm{}+\frac{B_{2k}}{(2k)!}s(s+1)\mathrm{}(s+2k2)N^{N2k+1}.`$
Then

$$\zeta (s)=S(N1,s)+B(N,k,s)+R_{2k},$$
(4)
where

$$|R_{2k2}|\left|\frac{s+2k1}{\sigma +2k1}\right||B_{2k}\text{term of }(\text{4})|.$$

### 2.2 Dirichlet series

Let $`K=𝐐(\sqrt{D})`$ be a real quadratic field with positive integer squarefree $`D`$ and $`\chi (n)=\left(\frac{\mathrm{\Delta }}{n}\right)`$ be the Kronecker symbol. Here

$$\mathrm{\Delta }=\{\begin{array}{cc}D,\hfill & \text{ }D1(mod4)\text{ ,}\hfill \\ 4D,\hfill & \text{ }D2,3(mod4)\text{.}\hfill \end{array}$$

Let $`A=\pi /\mathrm{\Delta },E(x)=_x^{\mathrm{}}\frac{e^t}{t}𝑑t,erfc(x)=\frac{2}{\pi }_x^{\mathrm{}}e^{t^2}𝑑t.`$
Proposition .

$$L(1,\chi )=\frac{1}{\sqrt{\mathrm{\Delta }}}\underset{n=1}{\overset{m}{}}\chi (n)E(An^2)+\underset{n=1}{\overset{m}{}}\left(\frac{\chi (n)}{n}\right)erfc(n\sqrt{A})+R_m,$$

where $`|R_m|<\frac{\mathrm{\Delta }^{3/2}}{\pi ^2}\frac{e^{Am^2}}{m^3}.`$

### 2.3 Remarks about $`L`$functions of elliptic curves

. Let $`E/𝐐`$ be an elliptic curve given in Weierstrass form by an equation

$$E:y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6,$$
(5)
and let $`b_2,b_4,b_6,b_8,c_4,c_6,\mathrm{\Delta },j`$ be the usual associated quantities . Let now (5) be a global minimal Weierstrass equation for $`E`$ over Z. For each prime $`p`$ the reduction (5) $`(modp)`$ defines a curve $`E_p`$ over the prime field $`𝐅_p`$. Let $`A_p`$ denote the number of points of $`E_p`$ rational over $`𝐅_p`$. Let

$$t_p=1+pA_p.$$

If $`p\mathrm{\Delta },`$ then $`t_p`$ is the trace of Frobenius and satisfies $`|T_p|2\sqrt{p}.`$ In the case Artin-Hasse zeta function of the elliptic curve $`E_p`$ is:

$$\zeta _{E_p}(s)=\frac{1t_pp^s+p^{12s}}{(1p^s)(1p^{1s})}.$$
(6)
If $`p\mathrm{\Delta },`$ then $`E_p`$ is not an elliptic curve and has a singularity $`S.`$ In the case

$$t_p=\{\begin{array}{cc}0,\hfill & \text{if }S\text{ is a cusp,}\hfill \\ 1,\hfill & \text{if }S\text{ is a node,}\hfill \\ 1,\hfill & \text{if }S\text{ is a node with tangent quadratic over }𝐅_p\hfill \end{array}$$

The Hasse-Weil  $`L`$function of $`E/𝐐`$ is defined by equation

$$Ł_E(s)=\underset{p|\mathrm{\Delta }}{}\frac{1}{(1t_pp^s)}\underset{p\mathrm{\Delta }}{}\frac{1}{1t_pp^s+p^{12s}}.$$
(7)
From the work of A. Wiles, R. Taylor and A. Wiles, and work of F. Diamond it is known that (semistable) elliptic curves over $`E/𝐐`$ are modular. Knowing the modularity of $`E/𝐐`$ is equivalent to the existence of a modular form $`f`$ on $`\mathrm{\Gamma }_0(N)`$ for some natural value $`N,`$ which we write $`f=a_nq^n.`$ The $`L`$function of $`E`$ is thus given by the Mellin transform of $`f,L(f,s)=a_nq^n.`$ In particular, the behavior of $`L(E,s)`$ at $`s=1`$ can be deduced from modular properties of $`E.`$
Let $`E/𝐐`$ be a modular elliptic curve and the global minimal model of the $`E/𝐐`$ has prime conductor $`l`$. Let $`p`$ be a prime and $`A_p`$ be the number of points of $`E_p`$ in $`𝐅_p.`$ Then there is exists a modular form $`f`$ on $`\mathrm{\Gamma }_0(l),f=_{n=1}^{\mathrm{}}a_nq^n,`$ where $`a_p,pl,`$ equals $`p+1A_p.`$

## 3 Some Algebraic Methods and Structures of Noncommutative Geometry

At first remind two definitions.
Hopf algebras.
Let $``$ be an algebra with unit $`e`$ over field $`k.`$ Let $`a,b,\mu (a,b)=ab`$ the product in $``$, $`\alpha k,p:k,p(\alpha )=\alpha e`$ the unit, $`\epsilon :k,\epsilon (a)=1,`$ the counit, $`\mathrm{\Delta }(a)=aa`$ the coproduct, $`S:`$ the antipode, such that the axioms
1)$`(1\mathrm{\Delta })\mathrm{\Delta }=(\mathrm{\Delta }1)\mathrm{\Delta }`$ (coassociativity);
2)$`\mu (1S)\mathrm{\Delta }=\mu (S1)\mathrm{\Delta }=p\epsilon `$ (antipode).
Then the system $`(,\mu ,p,\epsilon ,\mathrm{\Delta },S)`$ is called the Hopf algebra.
Let $`𝒜`$ and $``$ be $`C^{}`$-algebras. Let $`𝒦`$ be the $`C^{}`$-algebra of compact operators. If $`𝒜𝒦`$ is isomorphic to $`𝒦`$ then $`𝒜`$ is called Morita equivalent to $``$.
We give here some remarks to algebraic setting of papers . In a general context this algebraic setting includes:
\- Operator algebras.
\- Representation theory.
\- K-theory.
\- Algebraic geometry.
More specificaly: $`C^{}`$-algebras; finite projective modules; holonomy groupoid; groupoid for transformation groups; group $`C^{}`$-algebras; Morita equivalence; K-theory; von Neumann algebras; cyclic cohomology; invariant transversal measures and the Ruelle-Sullivan current; Godbillon-Vey class; Hopf algebras.
One of the paradigm of noncommutative geometry is to describe the geometry of ordinary space in terms of the algebra of functions and then deforming to the noncommutative case. By deformation theory as the part of moduli space theory some constructions of section 1 can be embedded into noncommutative geometry.

## 4 Appendix. The Common Lisp text of the packages CUTSET and CUTSETDG

Rooted graph $`G`$ is the graph that each node of $`G`$ is reachable from a node $`rG.`$ By cutset of the graph we shall understand an appropriated subset of nodes (called cutpoints) such that any cycle of the graph contains at least one cutpoint. DFS is the abbreviation of Depth First Search method. During DFS we numbering nodes and label (mark) edges. By Tarjan  the DFS method has linear complexity. The packages are implemented on Allegro CL 3.0.2 . The main function Cutsetdg of the package CUTSETDG computes Cutset (a subset of vertices which cut all cycles in the graph) of arbitrary rooted directed graph. It uses 3 functions: Adjarcn, Cutpoints and Unicut. For this program the author developed rather simple and efficient algorithm that based on DFS-method. The function is the base for Cutset methods for systems of procedures. The main function Cutset of the Package CUTSET computes Cutset of arbitrary rooted graph. It also uses 3 functions: Adjedgn, Cutpoints and Unicut. An algorithm for this function that based on DFS-method is also developed by the author. The algorithm is rather simple and efficient. The function is the base for Cutset methods. Package CUTSET
Title: Cutset of rooted graph
Summery: This package implements computation of a cutset of rooted graph. The graph have to defined by adjacency list.
Example of Call: (Cutset ’a) where ”a” is a root of exploring graph.

```
;; Name: Cutset
;;
;; Title: Cutset of rooted graph
;;
;; Author: Nikolaj M. Glazunov
;;
;; Summery:
;; This package implements computation of a cutset
;; of rooted graph. The graph have to defined by adjacency
;; list
;;
;; Allegro CL 3.0.2
;;
(DEFUN Cutset (startnode)

;; startnode is a root of exploring graph
;; DFS - Depth First Search method for connected graph
;; cuts - cutset of the graph
;; st - stack
;; v - exploring node
;; sv -  son of the exploring node
;; inl - inverse edges list
;; df -  DFS-numbering of the node (property)
;; Adjed - adjacency list of the node (property)
;; 1, 2  - lables

   (SETF (GET startnode ’df ) 1)   ;DFS-numbering is equal 1
         (SETF (GET startnode ’Adjed)
            (Adjedgn  (LIST startnode))) ;;startnode obtained the a-list
                                 ;; property Adjed (adjacency edges)

   (PROG ( st v sv inl  cuts)
         (PUSH startnode st)
   1   (SETQ v (CAR st)) ;;explored node received value from stack of nodes

   2      (COND ((NOT (EQ  NIL (GET v ’Adjed)))
                    (SETQ sv (CAAR (GET v ’Adjed)))

             (COND ((EQ NIL (GET sv ’df))
                          (SETF (GET sv ’df) (+ 1 (GET v ’df)))
       ;; modification of the edge of son’s adj-list
                      (SETF (GET sv ’Adjed)
            (Adjedgn  (LIST sv))) ;; node sv obtained the adj-list property
                                 ;; Adjed (adjesency edges)
     (SETF (GET v ’Adjed) (REMOVE (LIST sv v) (GET v ’Adjed) :TEST ’EQUAL))
     (SETF (GET sv ’Adjed) (REMOVE (LIST v sv) (GET sv ’Adjed) :TEST ’EQUAL))
                     (PUSH sv st)
                     (GO 1)
            )
               (T   ;; the node has number.
                       ;; the edge is inverse
                         (SETQ inl (CONS (CAR (GET v ’Adjed)) inl))
     (SETF (GET v ’Adjed) (REMOVE (LIST sv v) (GET v ’Adjed) :TEST ’EQUAL))
     (SETF (GET sv ’Adjed) (REMOVE (LIST v sv) (GET sv ’Adjed) :TEST ’EQUAL))
                     (GO 2)
                    )
               )
                 )
                           (T
                (POP st)
                  (COND     ((NOT (NULL st))
                      (GO 1)
              )
            (T                 ;; end
                   (SETQ cuts (Unicut (Cutpoints inl)))
                        (RETURN cuts)
                )
              )
                ))
     )
   )
(DEFUN Adjedgn (PATH)
      (MAPCAN #’(LAMBDA (E)
              (COND ((MEMBER (CAR E) (CDR E)) NIL)
                   (T (LIST E))))
          (MAPCAR #’(LAMBDA (E)
                            (CONS E PATH))
                (GET (CAR PATH) ’NEIGHBORS))))

(DEFUN Cutpoints (inl)
        (MAPCAR ’CAR inl))
(DEFUN Unicut (cpl)
     (COND ((NULL cpl) NIL)
           (T (CONS (CAR cpl)
                (Unicut (REMOVE (CAR cpl) cpl)))
             )
     )
     )

```

Package CUTSETDG
Title: Cutset of a rooted directed graph
Summery: This package implements computation of a cutset of a rooted directed graph. The graph have to defined by adjacency list.
Example of Call: (Cutsetdg ’a) where ”a” is a root of exploring graph.

The Common Lisp text of the package CUTSETDG

```

;; Name: Cutsetdg
;;
;; Title: Cutset of a rooted directed graph
;;
;; Author: Nikolaj M. Glazunov
;;
;; Summery:
;; This package implements computation of a cutset
;; of a rooted directed graph. The graph have to defined by adjacency
;; list
;;
;; Example of Call:   (Cutsetdg ’a)
;; where "a" is a root of exploring graph
;;
;; Allegro CL 3.0.2
;;
(DEFUN Cutsetdg (startnode)

;; startnode is a root of exploring graph
;; DFS - Depth First Search method for connected graph
;; st - stack
;; v - exploring node
;; sv -  son of the exploring node
;; inl - inverse edges list
;; df -  DFS-numbering of the node (property)
;; Outarcs - adjacency list of Output arcs of the node (property)
;; 1, 2  - lables

    (SETF (GET startnode ’df ) 1)   ;DFS-numbering is equal 1
   (SETF (GET startnode ’Outarcs)
            (Adjarcn  (LIST startnode))) ;;startnode obtained the a-list
                                 ;; property Outarcn (Output arcs of the
                                 ;; node)
    (PROG ( st v sv inl  cuts)
         (PUSH startnode st)
   1   (SETQ v (CAR st)) ;;explored node received value from stack of nodes
   2      (COND ((NOT (EQ  NIL (GET v ’Outarcs)))
                    (SETQ sv (CAAR (GET v ’Outarcs)))
                        (COND ((EQ NIL (GET sv ’df))
                            (SETF (GET sv ’df) (+ 1 (GET v ’df)))
       ;; modification of the edge of son’s adj-list
       (SETF (GET sv ’Outarcs)
            (Adjarcn  (LIST sv))) ;; node sv obtained the adj-list property
                                 ;; Outarcs (adjacency Outarcs)
          (SETF (GET v ’Outarcs) (REMOVE (LIST sv v) (GET v ’Outarcs)
                              :TEST ’EQUAL))
                           (PUSH sv st)
                            (GO 1)
            )
              (T
                 (COND ((AND (> (GET v ’df) (GET sv ’df))
                            (NOT (EQUAL v sv)))
              (SETQ inl (CONS (CAR (GET v ’Outarcs)) inl))
              (SETF (GET v ’Outarcs) (REMOVE (LIST sv v) (GET v ’Outarcs)
                              :TEST ’EQUAL))
                        (GO 2)
                        )
              (T
               (SETF (GET v ’Outarcs) (REMOVE (LIST sv v) (GET v ’Outarcs)
                              :TEST ’EQUAL))
                (GO 2)
                )
                       )
                )
                   )
                 )
                              (T
                (POP st)
         (COND     ((NOT (NULL st))
                      (GO 1)
              )
                     (T                 ;; end
                   (SETQ cuts (Unicut (Cutpoints inl)))
                (RETURN cuts)
                )
              )
                ))
     )
   )
(DEFUN Adjarcn (PATH)
      (MAPCAN #’(LAMBDA (E)
              (COND ((MEMBER (CAR E) (CDR E)) NIL)
                   (T (LIST E))))
          (MAPCAR #’(LAMBDA (E)
                            (CONS E PATH))
             (CAR  (GET (CAR PATH) ’NEIGHBORS)))))
(DEFUN Cutpoints (inl)
        (MAPCAR ’CAR inl))
(DEFUN Unicut (cpl)
     (COND ((NULL cpl) NIL)
           (T (CONS (CAR cpl)
                (Unicut (REMOVE (CAR cpl) cpl)))
             )
     )
     )

```