6 research outputs found
Sheaves and Duality in the Two-Vertex Graph Riemann-Roch Theorem
For each graph on two vertices, and each divisor on the graph in the sense of
Baker-Norine, we describe a sheaf of vector spaces on a finite category whose
zeroth Betti number is the Baker-Norine "Graph Riemann-Roch" rank of the
divisor plus one. We prove duality theorems that generalize the Baker-Norine
"Graph Riemann-Roch" Theorem
Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank
By a {\em Riemann function} we mean a function such that is equals for
sufficiently small, and equals
for a constant, -- the {\em offset of } -- for sufficiently large. By adding to the Baker-Norine rank
function of a graph, one gets an equivalent Riemann function, and similarly for
related rank functions. For such an , for any
there is a unique Riemann function such that for all we have which we call a {\em generalized Riemann-Roch formula}.
We show that any such equation can be viewed as an Euler charactersitic
equation of sheaves of a particular simple type that we call {\em diagrams}.
This article does not assume any prior knowledge of sheaf theory.
To certain Riemann functions there is a
simple family of diagrams such that and
.
Furthermore we give a canonical isomorphism where is the weight of
.
General Riemann functions are similarly
modeled with formal differences of diagrams. Riemann functions are modeled using their restrictions to two of their
variables. These constructions involve some ad hoc choices, although the
equivalence class of virtual diagram obtained is independent of the ad hoc
choices
Riemann functions, their weights, and modeling Riemann-Roch formulas as Euler characteristics
In this thesis, we discuss modelling with (virtual) k-diagrams a class of functions from ℤⁿ to ℤ, which we call Riemann functions, that generalize the graph Riemann-Roch rank functions of Baker and Norine. The graph Riemann-Roch theorem has seen significant activity in recent years, however, as of yet, there is not a satisfactory homological interpretation of this theorem. This may be viewed as disappointing given the rich homological theory contained in the classical Riemann-Roch theorem. For a graph Riemann-Roch function, we will be able to express the associated graph Riemann-Roch formula as a (virtual) Euler characteristic of the modelling (virtual) k-diagram. From the development of this approach, we obtain a new formula for computing the graph Riemann-Roch rank of the complete graph Kn.Science, Faculty ofMathematics, Department ofGraduat
L2-Betti numbers
This thesis aims to introduce the subject of L2-Betti numbers to the uninitiated reader. These L2-Betti numbers are invariants of regular G-coverings. They will first be introduced by means of functional analysis and later a more algebraic approach to their study will be employed. Three questions of particular importance will then be emphasized. These are the so called zero-in-the-spectrum conjecture, the Atiyah conjecture and L2-Betti number approximation.Cette thèse vise a initier le lecteur avec le sujet des nombres L2-Betti. Ces nombres sont des invariants de G-revêtements réguliers. Ils seront introduits en un premier temps en utilisant l'analyse fonctionnelle et, ensuite, une approche plus algébrique sera prise pour leur étude. L'emphase sera alors mise sur trois questions importantes. Ces questions sont: la conjecture zero-in-the-spectrum, la conjecture d'Atiyah et l'approximation des nombres L2-Betti
Generalized Riemann Functions, Their Weights, and the Complete Graph
By a {\em Riemann function} we mean a function such that is equals for
sufficiently small, and equals for a constant, , for
sufficiently large. By adding to the Baker-Norine rank
function of a graph, one gets an equivalent Riemann function, and similarly for
related rank functions.
To each Riemann function we associate a related function via M\"obius inversion that we call the {\em weight} of the
Riemann function. We give evidence that the weight seems to organize the
structure of a Riemann function in a simpler way: first, a Riemann function
satisfies a Riemann-Roch formula iff its weight satisfies a simpler symmetry
condition. Second, we will calculate the weight of the Baker-Norine rank for
certain graphs and show that the weight function is quite simple to describe;
we do this for graphs on two vertices and for the complete graph.
For the complete graph, we build on the work of Cori and Le Borgne who gave a
linear time method to compute the Baker-Norine rank of the complete graph. The
associated weight function has a simple formula and is extremely sparse (i.e.,
mostly zero). Our computation of the weight function leads to another linear
time algorithm to compute the Baker-Norine rank, via a formula likely related
to one of Cori and Le Borgne, but seemingly simpler, namely
Our study of weight functions leads to a natural generalization of Riemann
functions, with many of the same properties exhibited by Riemann functions