Related papers: Martin's Conjecture in the Enumeration Degrees
The signature of a path can be described as its full non-commutative exponential. Following T. Lyons we regard its expectation, the expected signature, as path space analogue of the classical moment generating function. The logarithm…
Uniform measures are defined as the functionals on the space of bounded uniformly continuous functions that are continuous on bounded uniformly equicontinuous sets. If every cardinal has measure zero then every countably additive measure is…
The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…
We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…
By observing the equivalence of assertions on determining the jump of a function by its differentiated or integrated Fourier series, we generalize a previous result of Kvernadze, Hagstrom and Shapiro to the whole class of functions of…
Jump functions are the {most-studied} non-unimodal benchmark in the theory of randomized search heuristics, in particular, evolutionary algorithms (EAs). They have significantly improved our understanding of how EAs escape from local…
In this paper, we generalize Zhou valuations, originally defined on complex domains, to the framework of general schemes. We demonstrate that an algebraic version of the Jonsson--Musta\c{t}\u{a} conjecture is equivalent to the statement…
We study an analogue of the Mertens conjecture in the setting of global function fields. Building on the work of Cha, we show that most hyperelliptic curves do not satisfy the Mertens conjecture, but that if we modify the Mertens conjecture…
We construct recursively-presented finitely-generated torsion groups which have bounded torsion and whose word problem is conjunctive equivalent (in particular positive and Turing equivalent) to a given recursively enumerable set. These…
In arithmetic statistics and analytic number theory, the asymptotic growth rate of counting functions giving the number of objects with order below $X$ is studied as $X\to \infty$. We define general counting functions which count…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
A jump system is defined as a set of integer points (vectors) with a certain exchange property, generalizing the concepts of matroids, delta-matroids, and base polyhedra of integral polymatroids (or submodular systems). A discrete convexity…
Eremenko and Lyubich proved that an entire function whose set of singular values is bounded is expanding at points where its image has large modulus. These expansion properties have been at the centre of the subsequent study of this class…