Related papers: Counting siblings in universal theories

Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…

Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Ulam asked whether every connected Lie group can be represented on a countable structure. This is known in the linear case. We establish it for the first family of non-linear groups, namely in the nilpotent case. Further context is…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

A celebrated theorem of P.M.Cohn says that for any two division rings (not necessarily finite dimensional) over a field F, their amalgamated product over F is a domain which can be embedded in a division ring. Note that even with the two…

We derive the embedding structure of unitary N=2 minimal models and show as a result that these representations have a degeneration of uncharged singular states. This corrects some earlier mistakes made in the literature. We discuss the…

The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…

In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…

We describe the general non-associative version of Lie theory that relates unital formal multiplications (formal loops), Sabinin algebras and non-associative bialgebras. Starting with a formal multiplication we construct a non-associative…

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

We introduce Poisson double algebroids, and the equivalent concept of double Lie bialgebroid, which arise as second-order infinitesimal counterparts of Poisson double groupoids. We develop their underlying Lie theory, showing how these…

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…

It is well known that any Lie algebra can be embedded into an associative algebra. We prove that any metabelian Lie algebra can be embedded into an algebra in the subvariety of perm algebras, i.e., associative algebras with the identity…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…