Related papers: A remark on Getzler's semi-classical approximation

Let $K$ be field of characteristic 2 and let $G$ be a finite non-abelian 2-group with the cyclic derived subgroup $G'$, and there exists a central element $z$ of order 2 in $Z(G) \backslash G'$. We prove that the unit group of the group…

We study the Gaberdiel-Goddard spaces of systems of correlation functions attached to an affine Kac-Moody Lie algebra $\gh$. We prove that these spaces are isomorphic to the spaces of coinvariants with respect to certain subalgebras of…

We prove a gluing lemma for sections of line bundles on a rigid analytic variety. We apply the lemma, in conjunction with a result of Buzzard's, to give a proof of (a generalization) of Coleman's theorem which states that overconvergent…

We calculate within a semiclassical approximation the autocorrelation function of cross sections. The starting point is the semiclassical expression for the diagonal matrix elements of an operator. For general operators with a smooth…

The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential…

Let $G_n$ denote the $n^{\rm th}$ Gleason polynomial, whose roots correspond to parameters $c$ such that the critical point $0$ is periodic of exact period $n$ under iteration of $z^2 + c$, and let $\bar{G}_n$ denote the reduction of $G_n$…

We prove a new case of mixed discrete joint universality theorem on approximation of certain target couple of analytic functions by the shifts of a pair consisting of the function belonging to wide class of Matsumoto zeta-functions and the…

The Curry-Howard correspondence is often described as relating proofs (in intutionistic natural deduction) to programs (terms in simply-typed lambda calculus). However this narrative is hardly a perfect fit, due to the computational content…

Keating and Snaith modeled the Riemann zeta-function \zeta(s) by characteristic polynomials of random NxN unitary matrices, and used this to conjecture the asymptotic main term for the 2k-th moment of \zeta(1/2+it) when k>-1/2. However, an…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

We prove that a certain conjecture holds true and the conjecture states a relationship between the zeta function of a finite category and the Euler characteristic of a finite category.

This paper treats about one of the most remarkable achievements by Riemann, that is the symmetric form of the functional equation for {\zeta}(s). We present here, after showing the first proof of Riemann, a new, simple and direct proof of…

We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable…

We study classes of objects whose combinatorics are closely related to those of posets. The framework of operads and operad algebras allows us to make this relationship precise and provides tools for a deeper understanding of their…

This talk is a sneak preview of the project, 'proof theory for theories of ordinals'. Background, aims, survey and furture works on the project are given. Subsystems of second order arithmetic are embedded in recursively large ordinals and…

We introduce a syntactic translation of Goedel's System T parametrized by a weak notion of a monad, and prove a corresponding fundamental theorem of logical relation. Our translation structurally corresponds to Gentzen's negative…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…

We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…