Related papers: A Note on Switching Conditions for the Generalized…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
We generalize the Arrow's impossibility theorem--a key result in social choice theory--to the setting where the arity $k$ of the relation under consideration is greater than $2$. Some special but natural properties of $k$-ary relations are…
We study limit theorems for partial sums of instantaneous functions of a homogeneous Markov chain on a general state space. The summands are heavy-tailed and the limits are stable distributions. The conditions imposed on the transition…
We generalise Ehrhard and Regnier's Taylor expansion from pure to probabilistic $\lambda$-terms through notions of probabilistic resource terms and explicit Taylor expansion. We prove that the Taylor expansion is adequate when seen as a way…
We discuss a new stochastic ordering for the sequence of independent random variables. It generalizes the stochastic precedence order that is defined for two random variables to the case $n>2$. All conventional stochastic orders are…
We characterise partition regularity for linear equations over the Piatetski-Shapiro numbers $\lfloor n^c \rfloor$ when $1 < c < c^\dag(s)$, where $s \geqslant 3$ is the number of variables. Here $c^\dag(3) = 12/11$ and $c^\dag(4) = 7/6$,…
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…
We consider a sequence of additive functionals {\phi_n}, set on a sequence of Markov chains {X_n} that weakly converges to a Markov process X. We give sufficient condition for such a sequence to converge in distribution, formulated in terms…
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types.…
A constructive version of Newton-Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field…
The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
The Canonical Transformation theory of Yanai and Chan [J. Chem. Phys. 124, 194106 (2006)] provides a rigorously size-extensive description of dynamical correlation in multireference problems. Here we describe a new formulation of the theory…
Let X be a projective curve over Q and t a non-constant Q-rational function on X of degree n>1. For every integer a pick a points P(a) on X such that t(P(a))=a. Dvornicich and Zannier (1994) proved that for large N the field Q(P(1), ...,…
In this paper some reflections on the concept of transition are presented: groupoids are introduced as models for the construction of a ``generalized logic'' whose basic statements involve pairs of propositions which can be conditioned. In…
In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing…
We study the existence of formal Taylor expansions for functions defined on fields of generalised series. We prove a general result for the existence and convergence of those expansions for fields equipped with a derivation and an…
We prove a complex Ruelle-Perron-Frobenius theorem for Markov shifts over an infinite alphabet, whence extending results by M. Pollicott from the finite to the infinite alphabet setting. As an application we obtain an extension of renewal…
We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…