Related papers: Homogeneous 1-based structures and interpretabilit…
Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…
We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…
We start an analysis of geometric properties of a structure relative to a reduct. In particular, we look at definability of groups and fields in this context. In the relatively one-based case, every definable group is isogenous to a…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
We give an example of a definable quotient in an o-minimal structure which cannot be eliminated over any set of parameters, giving a negative answer to a question of Eleftheriou, Peterzil, and Ramakrishnan. Equivalently, there is an…
We show that the weak monadic second order theory of the structure $({\mathbb Q}, <)$ is first order interpretable in its automorphism group.
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 (strong) first countability of locally solid convergence structures on Archimedean vector lattices. Among other results, we characterise those vector lattices for which relatively unform-, order-, and $\sigma$-order convergence,…
Recent research has recognized interpretability and robustness as essential properties of trustworthy classification. Curiously, a connection between robustness and interpretability was empirically observed, but the theoretical reasoning…
For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…
It is known that a single mapping defined on one term of a differential graded vector space extends to a strongly homotopy Lie algebra structure on the graded space when that mapping satisfies two conditions. This strongly homotopy Lie…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
We prove that a finite-dimensional irreducible Hopf algebra $H$ in positive characteristic is semisimple, if and only if it is commutative and semisimple, if and only if the restricted Lie algebra $P(H)$ of the primitives is a torus. This…
A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.
Recent years have seen a boom in interest in machine learning systems that can provide a human-understandable rationale for their predictions or decisions. However, exactly what kinds of explanation are truly human-interpretable remains…
Let G be a semisimple Lie group without compact factors, \Gamma be an irreducible lattice in G. In the first part of the article we give the necessary and sufficient condition under which a sequence of translates of probability…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
A series of associative algebras $A_n(V)$ for a vertex operator algebra $V$ over an arbitrary algebraically closed field and nonnegative integers $n$ are constructed such that there is a one to one correspondence between irreducible…