Related papers: On effective constructions of existentially closed…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We present a link between easy quantum groups, discrete groups and combinatorics. By this, we infer new connections between quantum isometry groups, reflection groups, varieties of groups and the combinatorics of partitions. More precisely,…
Does a space enjoying good finiteness properties admit an algebraic model with commensurable finiteness properties? In this note, we provide a rational homotopy obstruction for this to happen. As an application, we show that the maximal…
We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…
This article focuses on the study of the group of units of incidence rings, which is a class of infinite matrix groups indexed by ordered sets, on a topological perspective. We first show when these groups can inherit the topological…
We investigate the automorphisms of some $\kappa$- existentially closed groups. In particular, we prove that $Aut(G)$ is the union of subgroups of level preserving automorphisms and $|Aut(G)|=2^{\kappa}$ whenever $\kappa$ is inaccessible…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
Various limit-free formulas are given for the computation of the algebraic and the topological entropy, respectively in the settings of endomorphisms of locally finite discrete groups and of continuous endomorphisms of totally disconnected…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
A topological group is called a pro-Lie group if it is isomorphic to a closed subgroup of a product of finite-dimensional real Lie groups. This class of groups is closed under the formation of arbitrary products and closed subgroups and…
In this paper, we study a family of finitely generated elementary amenable iet-groups. These groups are generated by finitely many rationals iets and rotations. For them, we state criteria for not virtual nilpotency or solvability, and we…
A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html . The present paper contains a soundness…
We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…
We describe a new approach for classifying conjugacy classes of elementary abelian subgroups in simple algebraic groups over an algebraically closed field, and understanding the normaliser and centraliser structure of these. For toral…
It is proved that, in certain subgroups of direct products of countable groups, the property of being an unconditionally closed set coincides with that of being an algebraic set. In particular, these properties coincide in all Abelian…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We study definably compact definably connected groups definable in a sufficiently saturated real closed field $R$. We introduce the notion of group-generic point for $\bigvee$-definable groups and show the existence of group-generic points…
Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…