Related papers: Trace definability IV: higher arity notions
The $k$ nearest neighbour learning rule (under the uniform distance tie breaking) is universally consistent in every metric space $X$ that is sigma-finite dimensional in the sense of Nagata. This was pointed out by C\'erou and Guyader…
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
In a recent paper by D. Shakhmatov and J. Sp\v{e}v\'ak [Group-valued continuous functions with the topology of pointwise convergence, Topology and its Applications (2009), doi:10.1016/j.topol.2009.06.022] the concept of a ${\rm TAP}$ group…
We prove that if A is a \sigma-unital exact C*-algebra of real rank zero, then every state on K_0(A) is induced by a 2-quasitrace on A. This yields a generalisation of Rainone's work on pure infiniteness and stable finiteness of crossed…
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.
The classical trace map is a highly non-trivial map from algebraic K-theory to topological Hochschild homology (or topological cyclic homology) introduced by B\"okstedt, Hsiang and Madsen. It led to many computations of algebraic K-theory…
We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…
In this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called "uniform definability of types over finite sets" (UDTFS). We explore UDTFS and show how it relates to…
We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and…
We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…
We show that continuous group homomorphisms between unitary groups of unital C*-algebras induce maps between spaces of continuous real-valued affine functions on the trace simplices. Under certain $K$-theoretic regularity conditions, these…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
We prove the dp-finite case of the Shelah conjecture on NIP fields. If K is a dp-finite field, then K admits a non-trivial definable henselian valuation ring, unless K is finite, real closed, or algebraically closed. As a consequence, the…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formulas) with equality. Given a logic $\mathbf{\mathcal{L}}$, the…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of…
We propose global surjectivity theorems of differentiable maps based on second order conditions. Using the homotopy continuation method, we demonstrate that, for a $C^2$ differentiable map from a Hilbert space to a finite-dimensional…
We show how one can twist the definition of Hochschild homology of an algebra or a DG algebra by inserting a possibly non-additive trace functor. We then prove that many of the usual properties of Hochschild homology survive such a…