Graphs, \mathbb{F}_1-schemes and virtual mixed Tate motives

Publication date 23 November 2016

Abstract: In a number of recent works [6, 7] the authors have introduced and studied a functor

m a t h c a l F_{k}

which associates to each loose graph

G a m m a

-which is similar to a graph, but where edges with

0

or

1

vertex are allowed - a

k

-scheme, such that

m a t h c a l F_{k} (G a m m a)

is largely controlled by the combinatorics of

G a m m a

. Here,

k

is a field, and we allow

k

to be

m a t h b b F_{1}

, the field with one element. For each finite prime field

m a t h b b F_{p}

, it is noted in [6] that any

m a t h c a l F_{k} (G a m m a)

is polynomial-count, and the polynomial is independent of the choice of the field. In this note, we show that for each

k

, the class of

m a t h c a l F_{k} (G a m m a)

in the Grothendieck ring

K_{0} (e x t t t {S c h}_{k})

is contained in

m a t h b b Z [m a t h b b L]

, the integral subring generated by the virtual Lefschetz motive.

This page was built for publication: Graphs, $\mathbb{F}_1$-schemes and virtual mixed Tate motives