Related papers: Notes on trace equivalence
To a special type of grope embedded in 4-space, that we call an admissible grope, we associate a length function for each real number q at least 1. This gives rise to a family of pseudo-metrics d^q, refining the slice genus metric, on the…
This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…
We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen lifting properties %(negation) of certain…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Trace theory is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by individual program threads. Its simplicity, elegance, and…
We give an elementary estimate that entails and generalises numerous Korn inequalities scattered in the literature. As special instances, we obtain general Korn-type inequalities involving normal or tangential trace components, or lower…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
We study invariant types in NIP theories. Amongst other things: we prove a definable version of the (p,q)-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of M-invariant types to that…
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater…
We study the approximative trace for individual elements in the Sobolev space $W^{1,p}(\Omega)$ for $1\le p\le\infty$. This notion of a trace was introduced for $p=2$ in [AtE11] in the setting of general open sets…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…
There is no infinite sequence of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$ each of which proves $\Pi^1_1$-reflection of the next. This engenders a well-founded ``reflection ranking'' of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$.…
We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.
Parametrizing the possible underlying theory or new physics' decoupling effects in the most general way we reexamined the validity of canonical trace relation and chiral symmetry in certain one-loop two-point functions. The anomalies and…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
We conduct a systematic study of traces on locally compact groups, in particular traces on their universal and reduced C*-algebras. We introduce the trace kernel, and examine its relation to the von Neumann kernel and to small-invariant…
Finite metric spaces are the object of study in many data analysis problems. We examine the concept of weak isometry between finite metric spaces, in order to analyse properties of the spaces that are invariant under strictly increasing…