Related papers: On countable isotypic structures
We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
Let $\mathbb{F}$ be an algebraically closed field of characteristic zero. Recently, we proved that isotypic blocks are functorially equivalent over $\mathbb{F}$. In this article we provide an example of functorially equivalent blocks which…
We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…
A new class of infinite dimensional simple Lie algebras over a field with characteristic 0 are constructed. These are examples of non-graded Lie algebras. The isomorphism classes of these Lie algebras are determined. The structure space of…
We construct an infinite family of imaginary quadratic number fields with 2-class groups of type (2,2,2) whose Hilbert 2-class fields are finite.
In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…
In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…
In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…
We construct a projective variety with discrete, non-finitely generated automorphism group. As an application, we show that there exists a complex projective variety with infinitely many non-isomorphic real forms.
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
We give a categorification of the notion of a mathematical structure originally given by Bourbaki in their set theory textbook. We show that any isomorphism-invariant property of a finite structure can be computed by counting the number of…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
This paper builds fundamental perfect fields of positive characteristic and shows the structure of perfect fields that a field of positive characteristic is a perfect field if and only if it is an algebraic extension of a fundamental…