Related papers: Proving Properties of $\varphi$-Representations wi…
The Vampire automated theorem prover is extended to output machine-checkable proofs in the Dedukti concrete syntax for the LambdaPi-calculus modulo. This significantly reduces the trusted computing base, and in principle eases proof…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
It is known that it is a very restrictive condition for a frame $\{f_k\}_{k=1}^\infty$ to have a representation $ \{T^n \varphi\}_{n=0}^\infty$ as the orbit of a bounded operator $T$ under a single generator $\varphi\in\mathcal{H}.$ In this…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
This paper surveys the analysis of parametric Markov models whose transitions are labelled with functions over a finite set of parameters. These models are symbolic representations of uncountable many concrete probabilistic models, each…
The integral representation theorem for martingales has been widely used in probability theory. In this work, we propose and prove a general representation theorem for a class of set-valued submartingales. We also extend the stochastic…
A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive.…
We develop the theory of Wigner representations for general probabilistic theories (GPTs), a large class of operational theories that include both classical and quantum theory. The Wigner representations that we introduce are a natural way…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…
In structural proof theory, designing and working on large calculi make it difficult to get intuitions about each rule individually and as part of a whole system. We introduce two novel tools to help working on calculi using the approach of…
In this paper, we develop efficient and accurate algorithms for evaluating $\varphi(A)$ and $\varphi(A)b$, where $A$ is an $N\times N$ matrix, $b$ is an $N$ dimensional vector and $\varphi$ is the function defined by…
We present a detailed proof of Wolstenholme's theorem using an Egorychev-type contour integral and an exponential change of variables. All formal series manipulations are justified, and the connection with harmonic sums and Bernoulli…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
Let $f$ be a $r\times m$-matrix of holomorphic functions that is generically surjective. We provide explicit integral representation of holomorphic $\psi$ such that $\phi=f\psi$, provided that $\phi$ is holomorphic and annihilates a certain…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
The classical Shannon sampling theorem states that a signal f with Fourier transform F in L^2(R) having its support contained in (-\pi,\pi) can be recovered from the sequence of samples (f(n))_{n in Z} via f(t)=\sum_{n in Z} f(n) (sin(\pi…
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…
In this work, we study the fully automated inference of expected result values of probabilistic programs in the presence of natural programming constructs such as procedures, local variables and recursion. While crucial, capturing these…