Related papers: Logarithmic Space and Permutations
This paper continues the study of paragrassmann algebras begun in Part I with the definition and analysis of Toeplitz operators in the associated holomorphic Segal-Bargmann space. These are defined in the usual way as multiplication by a…
In this article, we study the local behaviour of the multiple polylogarithm functions at integer points, in the $s$-aspect. This is done by writing a Laurent type expansion at integer points, involving certain power series and rational…
We introduce a new formalisation of languages, called keyboards. We consider a set of elementary operations (writing/erasing a letter, going to the right or to the left,...) and we define a keyboard as a set of finite sequences of such…
Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial…
The second author has recently introduced a new class of L-series in the arithmetic theory of function fields over finite fields. We show that the value at one of these L-series encode arithmetic informations of certain Drinfeld modules…
Models on logarithmic lattices have recently been proposed as an alternative approach to the study of multi-scale nonlinear physics. Here, we introduce LogLatt, an efficient MATLAB library for the calculus between functions on…
On finite dimensional spaces, it is apparent that an operator is the product of two positive operators if and only if it is similar to a positive operator. Here, the class ${\mathcal L}^{+2}$ of bounded operators on separable infinite…
We investigate how large language models can be used as research tools in scientific computing while preserving mathematical rigor. We propose a human-in-the-loop workflow for interactive theorem proving and discovery with LLMs. Human…
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…
Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces satisfying all the axioms of GLP are…
In this paper we study the structure of the Algebraic Cobordism ring of a variety as a module over the Lazard ring, and show that it has relations in positive codimensions. We actually prove the stronger graded version. This extends the…
Logic programming is a declarative programming paradigm. Programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger works solely in terms of the operational semantics. So it…
We describe some results on moduli space of logarithmic connections equipped with framings on a $n$-pointed compact Riemann surface.
We define the field $\mathbb{L}$ of logarithmic hyperseries, construct on $\mathbb{L}$ natural operations of differentiation, integration, and composition, establish the basic properties of these operations, and characterize these…
Conformal field theories with correlation functions which have logarithmic singularities are considered. It is shown that those singularities imply the existence of additional operators in the theory which together with ordinary primary…
An important theorem in classical complexity theory is that LOGLOGSPACE=REG, i.e. that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce…
We introduce a proof language for Intuitionistic Multiplicative Additive Linear Logic (IMALL), extended with a modality B to capture mixed-state quantum computation. The language supports algebraic constructs such as linear combinations,…
We present a novel logic-based concept called Space Explanations for classifying neural networks that gives provable guarantees of the behavior of the network in continuous areas of the input feature space. To automatically generate space…
We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and…