Related papers: Beyond Borel-amenability: scales and superamenable…
We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…
Resonant motions of integrable systems subject to perturbations may continue to exist and to cover surfaces with parametric equations admitting a formal power expansion in the strength of the perturbation. Such series may be, sometimes,…
Machine Learning explainability techniques have been proposed as a means of `explaining' or interrogating a model in order to understand why a particular decision or prediction has been made. Such an ability is especially important at a…
Contents 1. Algebraicity criterion: statement 2. Proof of the algebraicity criterion. 3. Pseudoeffectivity and movable classes. 4. Harder-Narasimhan filtrations and pseudo-effectivity. 5. Pseudo-effectivity of relative canonical bundles. 6.…
Many constructions in computability theory rely on "time tricks". In the higher setting, relativising to some oracles shows the necessity of these. We construct an oracle~$A$ and a set~$X$, higher Turing reducible to~$X$, but for which…
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…
We present a selection of basic results on Borel reducibility of Borel ideals and equivalence relations, especially those with comparably short proofs. The focal point are reducibility/irreducibility results related to some special…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
In the current paper we attempt to transfer the notion of the projectional entropy, originally defined for multidimensional subshifts, to the case of actions of amenable groups. The main theorem states that if a system is strongly…
We study higher depth algebras. We introduce several examples of such structures starting from the notion of $N$-differential graded algebras and build up to the concept of $A_{\infty}^N$-algebras.
The irreducible alternative superbimodules are studied. The complete classification is obtained for even bimodules of arbitrary dimension and for finite-dimensional irreducible superbimodules over an algebraically closed field.
We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…
For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
We introduce a notion of constructibility for \'etale sheaves with torsion coefficients over a suitable class of adic spaces. This notion is related to the classical notion of constructibility for schemes via the nearby cycles functor. We…
We provide new criteria for the integrality and birationality of an extension of graded algebras in terms of the general notion of polar multiplicities of Kleiman and Thorup. As an application, we obtain a new criterion for when a module is…