Motivic height zeta functions

Let $C$ be a projective smooth connected curve over an algebraically closed field of characteristic zero, let $F$ be its field of functions, let $C_0$ be a dense open subset of $C$. Let $X$ be a projective flat morphism to $C$ whose generic fiber $X_F$ is a smooth equivariant compactification of $G$ such that $D=X_F\setminus G_F$ is a divisor with strict normal crossings, let $U$ be a surjective and flat model of $G$ over $C_0$. We consider a motivic height zeta function, a formal power series with coefficients in a suitable Grothendieck ring of varieties, which takes into account the spaces of sections $s$ of $X\to C$ of given degree with respect to (a model of) the log-anticanonical divisor $-K_{X_F}(D)$ such that $s(C_0)$ is contained in $U$. We prove that this power series is rational, that its "largest pole" is at $\mathbf L^{-1}$, the inverse of the class of the affine line in the Grothendieck ring, and compute the "order" of this pole as a sum of dimensions of various Clemens complexes at places of $C\setminus C_0$. This is a geometric analogue of a result over number fields by the first author and Yuri Tschinkel (Duke Math. J., 2012). The proof relies on the Poisson summation formula in motivic integration, established by Ehud Hrushovski and David Kazhdan (Moscow Math. J, 2009).Comment: 54 pages; revise

On Berry's conjectures about the stable order in PCF

PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the extensional and the stable order together form a bicpo. He made the following two conjectures: 1) "Extensional and stable order form not only a bicpo, but a bidomain." We refute this conjecture by showing that the stable order is not bounded complete, already for finitary PCF of second-order types. 2) "The stable order of the model has the syntactic order as its image: If a is less than b in the stable order of the model, for finite a and b, then there are normal form terms A and B with the semantics a, resp. b, such that A is less than B in the syntactic order." We give counter-examples to this conjecture, again in finitary PCF of second-order types, and also refute an improved conjecture: There seems to be no simple syntactic characterization of the stable order. But we show that Berry's conjecture is true for unary PCF. For the preliminaries, we explain the basic fully abstract semantics of PCF in the general setting of (not-necessarily complete) partial order models (f-models.) And we restrict the syntax to "game terms", with a graphical representation.Comment: submitted to LMCS, 39 pages, 23 pstricks/pst-tree figures, main changes for this version: 4.1: proof of game term theorem corrected, 7.: the improved chain conjecture is made precise, more references adde

Quantum Optimization Problems

Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a quantum optimization problem using polynomial-time quantum computations and introduces the notion of an ``universal'' quantum optimization problem similar to a classical ``complete'' optimization problem. We exhibit a canonical quantum optimization problem that is universal for the class of polynomial-time quantum optimization problems. We show in a certain relativized world that all quantum optimization problems cannot be approximated closely by quantum polynomial-time computations. We also study the complexity of quantum optimization problems in connection to well-known complexity classes.Comment: date change

Subshifts as Models for MSO Logic

We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of "pattern counting" subshifts. Conversely, we characterise logic fragments corresponding to various classes of subshifts (subshifts of finite type, sofic subshifts, all subshifts). Finally, we show by a separation result how the situation here is different from the case of tiling pictures studied earlier by Giammarresi et al.Comment: arXiv admin note: substantial text overlap with arXiv:0904.245