Related papers: A metric version of Schlichting's Theorem

This note extends the invariant defined in "An invariant of metric spaces under bornologous equivalences" to the coarse category.

The aim of this paper is twofold. The first is to give a quantitative version of Schmidt's subspace theorem for arbitrary families of higher degree polynomials. The second is to give a generalization of the subspace theorem for arbitrary…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

Certain criteria are demonstrated for a spatial derivation of a von Neumann algebra to generate a one-parameter semigroup of endomorphisms of that algebra. These are then used to establish a converse to recent results of Borchers and of…

We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…

Fractional supersymmetry denotes a generalisation of supersymmetry which may be constructed using a single real generalised Grassmann variable, $\theta = \bar{\theta}, \, \theta^n = 0$, for arbitrary integer $n = 2, 3, ...$. An explicit…

A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski,…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

A superintegrable system is, roughly speaking, a system that allows more integrals of motion than degrees of freedom. This review is devoted to finite dimensional classical and quantum superintegrable systems with scalar potentials and…

Schroedinger equations with position dependent mass which are scale invariant and admit second order integrals of motion are classified.

We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group $\text{SO}_m(\mathbb{C})$, given the FFT for $\text{O}_m(\mathbb{C})$. We then define, by means…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Using families of curves to generalize vector fields, the Lie bracket is defined on a metric space, M. For M complete, versions of the local and global Frobenius theorems hold, and flows are shown to commute if and only if their bracket is…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure…

We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…