Related papers: A Non-$\mathbb R$-Factorizable Product of $\mathbb…

We show that, assuming the existence of $\mathfrak{c}$ incomparable selective ultrafilters, there exists a Wallace semigroup whose infinite countable power is the least power which fails to be countably compact. This answers positively…

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

We deal with two forms of the "uniqueness cases" in the classification of large simple $K^*$-groups of finite Morley rank of odd type, where large means the $m_2(G)$ at least three. This substantially extends results known for even larger…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

We prove that if $\Gamma$ is an icc irreducible lattice in a product of connected non-compact rank one simple Lie groups with finite center, then the II$_1$ factor $L(\Gamma)$ is prime. In particular, we deduce that the II$_1$ factors…

We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…

A group is said to be capable if it is the central factor of some group. In this paper, among other results we have characterized capable groups of order $p^2q$, for any distinct primes $p, q$, which extends Theorem 1.2 of S. Rashid, N. H.…

We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…

The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…

Consider an expansion $\mathcal R=(R,<,+,\ldots)$ of an ordered divisible Abelian group of finite burden defining no nonempty subset $X$ of $R$ which is dense and codense in a definable open subset $U$ of $R$ with $X \subseteq U$. We…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

We produce an example of an irreducible discrete subgroup in the product $SL(2,\R)\times SL(2,\R)$ which is not a lattice. This answers a question asked in [15].

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

Given a countable group G, we consider the sets S_factor(G), S_eqrel(G), of subgroups F of the positive real line for which there exists a free ergodic probability measure preserving action G on X such that the fundamental group of the…

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical proposition [(Ax)R(x)] can be finitarily evidenced as:…