Related papers: A General Completeness Theorem for Skip-free Star …
We describe cohomological conditions that are necessary and sufficient for the existence of balanced dualizing dg-modules, generalizing a theorem of Van den Bergh for balanced dualizing complexes over graded algebras. As a consequence, we…
We prove a conjecture of Diaconis and Freedman (Ann. Probab. 1980) characterising the extreme points of the set of partially-exchangeable processes on a countable set. More concretely, we prove that the partially exchangeable sigma-algebra…
We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
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…
It is well known that, as $n$ tends to infinity, the probability of satisfiability for a random 2-SAT formula on $n$ variables, where each clause occurs independently with probability $\alpha/2n$, exhibits a sharp threshold at $\alpha=1$.…
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the…
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory.…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
We clarify what it means for two full dualities based on the same algebra to be different. Our main theorem gives conditions on two different alter egos of a finite algebra under which, if one yields a full duality, then the other does too.…
We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a sufficient condition under which the representation induced from a branching system of a directed graph is faithful and…
If one wishes to define a complete Leibniz algebra in such a way as to extend the notion of a complete Lie algebra, two distinct definitions can be found in the current literature. Since biderivations on complete Lie algebras have already…
We introduce a concept, $d$-complete, and show that a Lie algebra is $d$-complete if and only if its full graph is complete.
The classical lemma of Borel reads: any power series with real coefficients is the Taylor series of a smooth function. Algebraically this means the surjectivity of the completion map at a point, $C^\infty(\Bbb{R}^n) \twoheadrightarrow…
We say that one point process on the line $\mathbb{R}$ mimics another at a bandwidth $B$ if for each $n \ge 1$ the two point processes have $n$-level correlation functions that agree when integrated against all bandlimited test functions on…
A new generalization of the classical separate algebraicity theorem is suggested and proved.
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
Knowing when a graphical model is perfect to a distribution is essential in order to relate separation in the graph to conditional independence in the distribution, and this is particularly important when performing inference from data.…
I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when one makes the problem more challenging…
We prove that any countable discrete and torsion free subgroup of a general linear group over an arbitrary field or a similar subgroup of an almost connected Lie group satisfies the integral algebraic K-theoretic (split) Novikov conjecture…