Related papers: On countable isotypic structures

The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…

A group $G$ is called hereditarily non-topologizable if, for every $H\le G$, no quotient of $H$ admits a non-discrete Hausdorff topology. We construct first examples of infinite hereditarily non-topologizable groups. This allows us to prove…

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

We prove that if a finite group scheme $G$ over a field $k$ has essential dimension one, then it embeds in $PGL_{2/k}$. We use this to give an explicit classification of all infinitesimal group schemes of essential dimension one over any…

In this note we show that any basic abelian variety with additional structures over an arbitrary algebraically closed field of characteristic $p>0$ is isogenous to another one defined over a finite field. We also show that the category of…

We prove that two finite-dimensional commutative algebras over an algebraically closed field are isomorphic if and only if they give rise to isomorphic representations of the category of finite sets and surjective maps.

The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…

We prove for a large class of fields $F$ that every proper finite extension of $F_{pyth}$, the pythagorean closure of $F$, is not a pythagorean field. This class of fields contains number fields and fields $F$ that are finitely generated of…

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 determine all isomorphism classes of hyperfields of a given finite order which can be obtained as quotients of finite fields of sufficiently large order. Using this result, we determine which hyperfields of order at most 4 are quotients…

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

The literature in persistent homology often refers to a "structure theorem for finitely generated graded modules over a graded principal ideal domain". We clarify the nature of this structure theorem in this context.

A finite semifield is a finite nonassociative ring with identity such that the set of its nonzero elements is closed under the product. From any finite semifield a projective plane can be constructed. In this paper we obtain new semifield…

In this paper we explore some properties of H-structures. We describe a construction of H-structures based on one-dimensional asymptotic classes which preserves pseudo-finiteness. That is, the H-structures we construct are ultraproducts of…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.