Related papers: Relative exchangeability with equivalence relation…
We will explain how elementary concepts of relative homological algebra yield the Taylor tower for functors from pointed categories to abelian groups recovering the constructions of Johnson and McCarthy.
We discuss a universal relation that we call the $x-y$ swap relation, which plays a prominent role in the theory of topological recursion, Hurwitz theory, and free probability theory. We describe in a very precise and detailed way the…
Inspired by Lehner's results on exchangeability systems we define `weak conditional freeness' and `conditional freeness' for stationary processes in an operator algebraic framework of noncommutative probability. We show that these two…
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
Formalising the confrontation of opinions (models) to observations (data) is the task of Inferential Statistics. Information Theory provides us with a basic functional, the relative entropy (or Kullback-Leibler divergence), an asymmetrical…
A classical result of Halmos asserts that among measure preserving transformations the weak mixing property is generic. We extend Halmos' result to the collection of ergodic extensions of a fixed, but arbitrary, ergodic transformation…
This paper is mainly devoted to a structure study of Hom-alternative algebras . Equivalent conditions for Hom-alternative algebras being solvable, simple and semi-simple are displayed. Moreover some results about Hom-alternative bimodule…
Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the…
Based on an axiomatic approach we propose two related novel one-parameter families of indicators of change which put in a relation classical indicators of change such as absolute change, relative change and the log-ratio.
We introduce a framework uniting algorithmic randomness with exchangeable credences to address foundational questions in philosophy of probability and philosophy of science. To demonstrate its power, we show how one might use the framework…
Radar-holonomic congruences of wordlines are proposed as a weaker substitute for the too restrictive class of Born-rigid motions. The definition is expressed as a set of differential equations. Integrability conditions and Cauchy data are…
The aim of this note is threefold. The first is to obtain a simple characterization of relative constructible sheaves when the parameter space is projective. The second is to study the relative Fourier-Mukai for relative constructible…
Let $\Om$ be a Borel subset of $S^\Bbb N$ where $S$ is countable. A measure is called exchangeable on $\Om$, if it is supported on $\Om$ and is invariant under every Borel automorphism of $\Om$ which permutes at most finitely many…
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…
The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…
The $r$-KdV-CH hierarchy is a generalization of the Korteweg-de Vries and Camassa-Holm hierarchies parametrized by $r+1$ constants. In this paper we clarify some properties of its multi-Hamiltonian structures, prove the semisimplicity of…
This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…
Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking account of notions such as order or distance). This paper…
In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…
De Finetti's theorem, also called the de Finetti-Hewitt-Savage theorem, is a foundational result in probability and statistics. Roughly, it says that an infinite sequence of exchangeable random variables can always be written as a mixture…