Related papers: A Statement of the Fundamental Lemma
If one proposes to use the theory of Eisenstein cohomology to prove algebraicity results for the special values of automorphic L-functions as in my work with Harder for Rankin-Selberg L-functions, or its generalizations as in my work with…
With respect to the analytic-algebraic dichotomy, the theory of Siegel modular forms of half-integral weight is lopsided; the analytic theory is strong whereas the algebraic lags behind. In this paper, we capitalise on this to establish the…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
Provides a counterexample to a long standing conjecture of A. Adem regarding the behaviour of the integral cohomology of a p-group.
We extend the Langlands program in various subprograms with certain different generalizations: (1) Mixed-parity functorial perturbation of the usual Langlands program after Fargues-Scholze in all characteristics; (2) Robba-Frobenius…
After some general remarks about the interrelation between philosophical and statistical thinking, the discussion centres largely on significance tests. These are defined as the calculation of $p$-values rather than as formal procedures for…
The first part of the paper is a survey of recent results about the cohomology of $(\phi,\Gamma)$-modules and its applications to the theory of Selmer complexes. In the second part we formulate a version of the Main Conjecture for $p$-adic…
We extend the theory of local constants to l-adic families of representations of GL_n(F) where F is a p-adic field with l not equal to p. We construct zeta integrals and gamma factors for representations coming from the conjectural "local…
This paper presents an approach to lemma synthesis to support advanced inductive entailment procedures based on separation logic. We first propose a mechanism where lemmas are automatically proven and systematically applied. The lemmas may…
Inspired by Emerton's work for GL(2), we study the completed cohomology of the tower of finite sets associated with a definite unitary group in two variables. When p splits (and other technical assumptions are fulfilled), we show that the…
This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build…
We introduce a $p$-adic analogue of the incomplete gamma function. We also introduce quantities ($m$-values) associated to a function on natural numbers and prove a new characterization of $p$-adic continuity for functions with $p$-integral…
P-values are a mainstay in statistics but are often misinterpreted. We propose a new interpretation of p-value as a meaningful plausibility, where this is to be interpreted formally within the inferential model framework. We show that, for…
Let G be any reductive p-adic group. We discuss several conjectures, some of them new, that involve the representation theory and the geometry of G. At the heart of these conjectures are statements about the geometric structure of Bernstein…
Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a…
The programming language Prolog makes declarative programming possible, at least to a substantial extent. Programs may be written and reasoned about in terms of their declarative semantics. All the advantages of declarative programming are…
In this thesis, we aim to develop p-adic analogs of known results for classical periods, focusing specifically on 1-motives. We establish an integration theory for 1-motives with good reductions, which generalizes the…
This note corrects a minor misstatement in section 2 of the paper in the title (arXiv:0808.3426). It also addresses some related issues. The error does not affect the main results of that paper, but nevertheless this corrigendum seems…
We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…
I introduce PEDAL -- a probabilistic epistemic logic meant to capture, in propositional dynamic terms, the epistemic state of an agent engaged in checking whether a program meets its specification. Semantically, PEDAL is built `on top of'…