Related papers: Dependent finitely homogneneous rosy structures
We show that the automorphism group of a linking system associated to a saturated fusion system $\mathcal{F}$ depends only on $\mathcal{F}$ as long as the object set of the linking system is $\mathrm{Aut}(\mathcal{F})$-invariant. This was…
In the first part of the paper we study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories. Then we try to develop analogous theory for arbitrary dependent theories.
This paper is an expository account of the theory of stable infinity categories. We prove that the homotopy category of a stable infinity category is triangulated, and that the collection of stable infinity categories is closed under a…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We investigate big Ramsey degrees of finite substructures of the universal countable homogeneous meet-tree and its binary variant. We prove that structures containing antichains have infinite big Ramsey degrees, and the big Ramsey degree of…
In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…
Ian Leary inquires whether a class of hyperbolic finitely presented groups are residually finite. We answer in the affirmative by giving a systematic version of a construction in his paper, which shows that the standard 2-complexes of these…
We explore the class of triples (M, nabla, P) where M is a manifold, nabla is an affine connection in M and P is a G-structure in M. Inside this class there are infinitesimally homogeneous manifolds, characterized by having G-constant…
Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
We study Dirichlet forms and Laplacians on self-similar sets with overlaps. A notion of "finitely ramified of finite type($f.r.f.t.$) nested structure" for self-similar sets is introduced. It allows us to reconstruct a class of self-similar…
We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first…
In this paper, we characterise metric spaces which have topologically connected Higson coronas. The characterisation is given by a natural categorical condition applied in the coarse category. We also give a characterisation in terms of…
We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…
We describe all binary simple homogeneous structures M in terms of 0-definable equivalence relations on M, which "coordinatize" M and control dividing, and extension properties that respect these equivalence relations.
We consider rationally connected complex projective manifolds M and show that their loop spaces--infinite dimensional complex manifolds--have properties similar to those of M. Furthermore, we give a finite dimensional application concerning…
We survey the history of Shelah's conjecture on strongly dependent fields, give an equivalent formulation in terms of a classification of strongly dependent fields and prove that the conjecture implies that every strongly dependent field…
For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…