Related papers: Many non-embeddable infinite groups

We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset is contained in another) using group-theoretical considerations, and obtain an upper bound on the cardinality of such an antichain. We apply…

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

Let $G$ be a compact connected Lie group and let $P$ be a principal $G$-bundle over $K$. The gauge group of $P$ is the topological group of automorphisms of $P$. For fixed $G$ and $K$, consider all principal $G$-bundles $P$ over $K$. It is…

Motivated by examples in infinite group theory, we classify the finite groups whose subgroups can never be decomposed as direct products.

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

A subset X of a group G is a set of pairwise non-commuting ele- ments if ab 6= ba for any two distinct elements a and b in X. If jXj ? jY j for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset…

Answering a problem of Eklof and Mekler, we show that there is a reflexive group of cardinality >= first measurable.

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

Given an arbitrary measurable cardinal $\kappa$, a nondiscrete Hausdorff extremally disconnected topological group of cardinality $\kappa$ is constructed.

We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…

Much of the theory of large cardinals beyond a measurable cardinal concerns the structure of elementary embeddings of the universe of sets into inner models. This paper seeks to answer the question of whether the inner model uniquely…

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…

For a finite group $G$, let $m_I(G)$ denote the largest possible cardinality of a minimal invariable generating set of $G$. We prove an upper and a lower bound for $m_I(S_n)$, which show in particular that $m_I(S_n)$ is asymptotic to $n/2$…

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

Let $m\geq 3$ be a positive integer. We prove that there are uncountably many non-commensurable metabelian uniform pro-$p$ groups of dimension $m$. Consequently, there are uncountably many non-commensurable finitely presented pro-$p$ groups…

We prove that there exist infinitely many a non-abelian strongly real Beauville $p$-group for every prime $p$. Previously only finitely many in the case $p=2$ have been constructed.

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…