Related papers: General Non-structure Theory
We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…
For a given complex n-fold M we present an explicit construction of all complex (n+1)-folds which are principal holomorphic T2-fibrations over M. For physical applications we consider the case of M being a Calabi-Yau 2-fold. We show that…
A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…
Let $F$ be a local field with residue field $k$. The classifying space of $GL_n(F)$ comes canonically equipped with a map to the delooping of the $K$-theory space of $k$. Passing to loop spaces, such a map abstractly encodes a homotopy…
We present a construction, which assigns two groupoids, $\Gugamma$ and $\Gmgamma$, to an inverse semigroup $\Gamma$. By definition, $\Gmgamma$ is a subgroupoid (even a reduction) of $\Gugamma$. The construction unifies known constructions…
The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…
We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description. We carry out a precise distributional analysis of…
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…
We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…
We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…
We study the $\kappa$-Borel-reducibility of isomorphism relations of complete first order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T', if T is classifiable and T' is…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…
The k-truss model is one of the most important models in cohesive subgraph analysis. The k-truss decomposition problem is to compute the trussness of each edge in a given graph, and has been extensively studied. However, the conventional…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…
In the first paper of this series (arxiv.org/abs/1210.2961) we studied the asymptotic behavior of Betti numbers, twisted torsion and other spectral invariants for sequences of lattices in Lie groups G. A key element of our work was the…